COMPUTATIONAL RESULTS WITH A CUTTING PLANE ALGORITHM FOR DESIGNING COMMUNICATION-NETWORKS WITH LOW-CONNECTIVITY CONSTRAINTS
成果类型：
Article
署名作者：
GROTSCHEL, M; MONMA, CL; STOER, M
署名单位：
Telcordia Technologies
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.40.2.309
发表日期：
1992
页码：
309-330
关键词：
摘要：
We describe a cutting plane approach to the problem of designing survivable fiber optic communication networks. This problem can be formulated as a minimum cost network design problem with certain low-connectivity constraints. Computational results on real-world telephone network design problems demonstrate the effectiveness of our cutting plane method. The facet-inducing inequalities for the convex hull of the solutions to this problem on which our algorithm is based are studied in detail in a companion paper.