TY - JOUR
T1 - Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems
AU - Leitner, Markus
PY - 2016/9/1
Y1 - 2016/9/1
N2 - In this article, we introduce the Generalized { 0 , 1 , 2 } -Survivable Network Design Problem ({ 0 , 1 , 2 } -GSNDP) which has applications in the design of backbone networks. Different mixed integer linear programming formulations are derived by combining previous results obtained for the related { 0 , 1 , 2 } -GSNDP and Generalized Network Design Problems. An extensive computational study comparing the correspondingly developed branch-and-cut approaches shows clear advantages for two particular variants. Additional insights into individual advantages and disadvantages of the developed algorithms for different instance characteristics are given.
AB - In this article, we introduce the Generalized { 0 , 1 , 2 } -Survivable Network Design Problem ({ 0 , 1 , 2 } -GSNDP) which has applications in the design of backbone networks. Different mixed integer linear programming formulations are derived by combining previous results obtained for the related { 0 , 1 , 2 } -GSNDP and Generalized Network Design Problems. An extensive computational study comparing the correspondingly developed branch-and-cut approaches shows clear advantages for two particular variants. Additional insights into individual advantages and disadvantages of the developed algorithms for different instance characteristics are given.
KW - Biconnectivity
KW - Branch-and-cut
KW - Generalized network design
KW - Mixed integer linear programming
KW - Survivability
UR - http://www.scopus.com/inward/record.url?scp=84959516030&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84959516030&partnerID=8YFLogxK
U2 - 10.1007/s10589-016-9836-y
DO - 10.1007/s10589-016-9836-y
M3 - Article
AN - SCOPUS:84959516030
SN - 0926-6003
VL - 65
SP - 73
EP - 92
JO - Computational Optimization and Applications
JF - Computational Optimization and Applications
IS - 1
ER -