EconPapers    
Economics at your fingertips  
 

Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems

Markus Leitner ()
Additional contact information
Markus Leitner: University of Vienna

Computational Optimization and Applications, 2016, vol. 65, issue 1, No 3, 73-92

Abstract: Abstract In this article, we introduce the Generalized $$\{0,1,2\}$$ { 0 , 1 , 2 } -Survivable Network Design Problem ( $$\{0,1,2\}$$ { 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\}$$ { 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.

Keywords: Generalized network design; Survivability; Biconnectivity; Branch-and-cut; Mixed integer linear programming (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-016-9836-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:65:y:2016:i:1:d:10.1007_s10589-016-9836-y

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-016-9836-y

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:coopap:v:65:y:2016:i:1:d:10.1007_s10589-016-9836-y