Strong Formulations for 2-Node-Connected Steiner Network Problems
From MaRDI portal
Publication:5505657
DOI10.1007/978-3-540-85097-7_18zbMath1168.90579OpenAlexW1524370859WikidataQ56977253 ScholiaQ56977253MaRDI QIDQ5505657
Markus Chimani, Maria Kandyba, Petra Mutzel, Ivana Ljubić
Publication date: 27 January 2009
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_18
Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items
Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice, Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems, Strong Formulations for 2-Node-Connected Steiner Network Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Design of survivable networks
- On implementing the push-relabel method for the maximum flow problem
- Strong lower bounds for the prize collecting Steiner problem in graphs
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
- Steiner problem in networks: A survey
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
- Strong formulations for network design problems with connectivity requirements
- Obtaining Optimalk-Cardinality Trees Fast
- Design of Survivable Networks: A survey
- A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- Improved algorithms for the Steiner problem in networks
- Using a hybrid of exact and genetic algorithms to design survivable networks
