Strong lower bounds for a survivable network design problem
From MaRDI portal
Publication:2883576
DOI10.1016/J.ENDM.2010.05.038zbMATH Open1237.90173OpenAlexW1986165143WikidataQ57705373 ScholiaQ57705373MaRDI QIDQ2883576FDOQ2883576
Authors: Markus Leitner, Günther R. Raidl 
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.038
Recommendations
- scientific article; zbMATH DE number 795223
- Connectivity-splitting models for survivable network design
- scientific article; zbMATH DE number 176255
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Strong formulations for network design problems with connectivity requirements
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- The directed subgraph homeomorphism problem
- Branch-and-price: Column generation for solving huge integer programs
- Design of Survivable Networks: A survey
- A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks
- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
Cited In (12)
- Stabilizing branch-and-price for constrained tree problems
- Strong formulations for network design problems with connectivity requirements
- Approximating survivable networks with \(\beta \)-metric costs
- A hybrid optimization approach for the Steiner \(k\)-connected network design problem
- Formulations for designing robust networks. An application to wind power collection
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- Additive Approximation for Bounded Degree Survivable Network Design
- Distance transformation for network design problems
- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
- Fast Approximation Algorithms for the Generalized Survivable Network Design Problem
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
This page was built for publication: Strong lower bounds for a survivable network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883576)
