Home > Research > Publications & Outputs > Hierarchical Survivable Network Design Problems
View graph of relations

Hierarchical Survivable Network Design Problems

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>1/06/2016
<mark>Journal</mark>Electronic Notes in Discrete Mathematics
Number of pages8
Pages (from-to)229-236
Publication StatusPublished
Early online date20/05/16
<mark>Original language</mark>English


We address the problem of designing two-level networks protected against single edge failures. A set of nodes must be partitioned into terminals and hubs, hubs must be connected through a backbone network, and terminals must be assigned to hubs and connected to them through access networks, being the objective to minimize the total cost. We consider two survivable structures, two-edge connected (2EC) networks and rings, in both levels of the network. We present an integer programming formulation for these problems, solve them using a branch-and-cut algorithm, and show some computational results.