Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
Martin Grötschel, Clyde L. Monma, Mechthild Stoer
Operations Research · 1992 · Volume 40 · Issue 2
Abstract
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.
Keywords
communications, designing optic-based survivable communication systems, programming, integer: cutting plane/facet generation
Enable JavaScript for citation tools and additional paper interactions.