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

Published

Standard

Hierarchical Survivable Network Design Problems. / Rodríguez-Martín, Inmaculada; Salazar-González, Juan José; Yaman, Hande.

In: Electronic Notes in Discrete Mathematics, Vol. 52, 01.06.2016, p. 229-236.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Rodríguez-Martín, I, Salazar-González, JJ & Yaman, H 2016, 'Hierarchical Survivable Network Design Problems', Electronic Notes in Discrete Mathematics, vol. 52, pp. 229-236. https://doi.org/10.1016/j.endm.2016.03.030

APA

Rodríguez-Martín, I., Salazar-González, J. J., & Yaman, H. (2016). Hierarchical Survivable Network Design Problems. Electronic Notes in Discrete Mathematics, 52, 229-236. https://doi.org/10.1016/j.endm.2016.03.030

Vancouver

Rodríguez-Martín I, Salazar-González JJ, Yaman H. Hierarchical Survivable Network Design Problems. Electronic Notes in Discrete Mathematics. 2016 Jun 1;52:229-236. https://doi.org/10.1016/j.endm.2016.03.030

Author

Rodríguez-Martín, Inmaculada ; Salazar-González, Juan José ; Yaman, Hande. / Hierarchical Survivable Network Design Problems. In: Electronic Notes in Discrete Mathematics. 2016 ; Vol. 52. pp. 229-236.

Bibtex

@article{dbd65d3f92534c16958c936652187d2d,
title = "Hierarchical Survivable Network Design Problems",
abstract = "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.",
keywords = "Branch-and-cut, Network design, Survivability",
author = "Inmaculada Rodr{\'i}guez-Mart{\'i}n and Salazar-Gonz{\'a}lez, {Juan Jos{\'e}} and Hande Yaman",
year = "2016",
month = jun,
day = "1",
doi = "10.1016/j.endm.2016.03.030",
language = "English",
volume = "52",
pages = "229--236",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",

}

RIS

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 -