Home > Research > Publications & Outputs > A branch-and-cut algorithm for two-level surviv...


Text available via DOI:

View graph of relations

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

Research output: Contribution to journalJournal articlepeer-review

<mark>Journal publication date</mark>03/2016
<mark>Journal</mark>Computers and Operations Research
Number of pages11
Pages (from-to)102-112
Publication StatusPublished
Early online date28/09/15
<mark>Original language</mark>English


This paper approaches the problem of designing a two-level network protected against single-edge failures. The problem simultaneously decides on the partition of the set of nodes into terminals and hubs, the connection of the hubs through a backbone network (first network level), and the assignment of terminals to hubs and their connection through access networks (second network level). We consider two survivable structures in both network levels. One structure is a two-edge connected network, and the other structure is a ring. There is a limit on the number of nodes in each access network, and there are fixed costs associated with the hubs and the access and backbone links. The aim of the problem is to minimize the total cost. We 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. Some of the new inequalities can be used also to solve other problems in the literature, like the plant cycle location problem and the hub location routing problem. (C) 2015 Elsevier Ltd. All rights reserved.