Strong lower bounds for a survivable network design problem

DOI10.1016/J.ENDM.2010.05.038MaRDI QIDQ2883576zbMATHOpenAlexWikidataFDO

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

zbMATH Keywords

column generationmixed integer programmingsurvivable network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Mixed integer programming (90C11)

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

Cites work

• A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
• A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks
• Branch-and-price: Column generation for solving huge integer programs
• Design of Survivable Networks: A survey
• The directed subgraph homeomorphism problem

Cited in

(12)

• Distance transformation for network design problems
• Approximating survivable networks with \(\beta \)-metric costs
• Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
• Additive Approximation for Bounded Degree Survivable Network Design
• Stabilizing branch-and-price for constrained tree problems
• Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
• A hybrid optimization approach for the Steiner \(k\)-connected network design problem
• Formulations for designing robust networks. An application to wind power collection
• A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
• Strong Formulations for 2-Node-Connected Steiner Network Problems
• Fast Approximation Algorithms for the Generalized Survivable Network Design Problem
• Strong formulations for network design problems with connectivity requirements

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)