Final published version
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - Hierarchical Survivable Network Design Problems
AU - Rodríguez-Martín, Inmaculada
AU - Salazar-González, Juan José
AU - Yaman, Hande
PY - 2016/6/1
Y1 - 2016/6/1
N2 - 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.
AB - 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.
KW - Branch-and-cut
KW - Network design
KW - Survivability
U2 - 10.1016/j.endm.2016.03.030
DO - 10.1016/j.endm.2016.03.030
M3 - Journal article
AN - SCOPUS:84969584458
VL - 52
SP - 229
EP - 236
JO - Electronic Notes in Discrete Mathematics
JF - Electronic Notes in Discrete Mathematics
SN - 1571-0653
ER -