Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints
M Grötschel, CL Monma, M Stoer - Operations Research, 1992 - pubsonline.informs.org
M Grötschel, CL Monma, M Stoer
Operations Research, 1992•pubsonline.informs.orgWe 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.
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.
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.
INFORMS以上显示的是最相近的搜索结果。 查看全部搜索结果