Final published version
Research output: Contribution to Journal/Magazine › Journal article › peer-review
<mark>Journal publication date</mark> | 1/06/2016 |
---|---|
<mark>Journal</mark> | Electronic Notes in Discrete Mathematics |
Volume | 52 |
Number of pages | 8 |
Pages (from-to) | 229-236 |
Publication Status | Published |
Early online date | 20/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.