Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints

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.