A branch-and-cut algorithm for two-level survivable network design problems

TLDR: This paper approaches the problem of designing a two-level network protected against single-edge failures by giving integer programming formulations and valid inequalities for the different versions of the problem, solving them using a branch-and-cut algorithm, and discussing computational results.

About: This article is published in Computers & Operations Research.The article was published on 2016-03-01 and is currently open access. It has received 16 citations till now. The article focuses on the topics: Backbone network & Network planning and design.

Figures

Table 7 Average percentages of cuts added during de branch-and-cut algorithm.

Table 1 Results for the ring/ring network design problem.

Fig. 1. A ring/ring solution example.

Fig. 2. A 2EC/2EC solution example.

Table 6 Effect of adding valid inequalities on the Class II instance with n¼15 and f jA ½1;500 .

Table 4 Results for the 2EC/2EC network design problem.

Frequently asked questions

Q1. What are the contributions in "A branch-and-cut algorithm for two-level survivable network design problems" ?

This paper approaches the problem of designing a two-level network protected against single-edge failures. The authors consider two survivable structures in both network levels. The aim of the problem is to minimize the total cost. The authors give integer programming formulations and valid inequalities for the different versions of the problem, solve them using a branch-and-cut algorithm, and discuss computational results.