Disruptions in infrastructure networks to transport material, energy, and information can have serious economic, and even catastrophic, consequences. Since these networks require enormous investments, network service providers emphasize both survivability and cost effectiveness in their topological design decisions. This paper addresses the survivable network design problem, a core model incorporating the cost and redundancy trade-offs facing network planners. Using a novel connectivity upgrade strategy, we develop several families of inequalities to strengthen a multicommodity flow-based formulation for the problem, and show that some of these inequalities are facet defining. By increasing the linear programming lower bound, the valid inequalities not only lead to better performance guarantees for heuristic solutions, but also accelerate exact and approximate solution methods. We also consider a heuristic strategy that sequentially rounds the fractional values, starting with the linear programming solution to our strong model. Extensive computational tests confirm, that the valid, inequalities, added via a cutting plane algorithm., and the heuristic procedure are very effective, and their performance is robust to changes in the network dimensions and connectivity structure. Our solution approach generates tight lower and upper bounds with average gaps that are less than 1.2% for various problem sizes and connectivity requirements.
- Integer programming: Cutting plane/facet
- Networks/graphs: Applications, theory
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research