Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints

The authors 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 the present cutting plane method. The facet-inducing inequalities for the convex hull of the solutions to this problem on which the algorithm is based are studied in detail in a companion paper.