Strong lower bounds for a survivable network design problem
From MaRDI portal
(Redirected from Publication:2883576)
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 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
- Branch-and-price: Column generation for solving huge integer programs
- Design of Survivable Networks: A survey
- The directed subgraph homeomorphism problem
Cited in
(12)- A hybrid optimization approach for the Steiner k-connected network design problem
- Formulations for designing robust networks. An application to wind power collection
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable 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
- Strong formulations for network design problems with connectivity requirements
- Distance transformation for network design problems
- Stabilizing branch-and-price for constrained tree problems
- Additive Approximation for Bounded Degree Survivable Network Design
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- Approximating survivable networks with \(\beta \)-metric costs
- 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)
