Strong Formulations for 2-Node-Connected Steiner Network Problems
DOI10.1007/978-3-540-85097-7_18zbMATH Open1168.90579OpenAlexW1524370859WikidataQ56977253 ScholiaQ56977253MaRDI QIDQ5505657FDOQ5505657
Authors: Markus Chimani, Maria Kandyba, Ivana Ljubić, Petra Mutzel 
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
Recommendations
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
- Strong formulations for network design problems with connectivity requirements
- Strong lower bounds for a survivable network design problem
- scientific article; zbMATH DE number 2196281
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- The traveling salesman problem. A computational study.
- Strong lower bounds for the prize collecting Steiner problem in graphs
- Design of Survivable Networks: A survey
- Title not available (Why is that?)
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- Strong formulations for network design problems with connectivity requirements
- Design of survivable networks
- Steiner problem in networks: A survey
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- On implementing the push-relabel method for the maximum flow problem
- Title not available (Why is that?)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Improved algorithms for the Steiner problem in networks
- Title not available (Why is that?)
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
- Using a hybrid of exact and genetic algorithms to design survivable networks
- 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
- Obtaining Optimalk-Cardinality Trees Fast
Cited In (10)
- Strong formulations for network design problems with connectivity requirements
- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
- Title not available (Why is that?)
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\)
- Distance transformation for network design problems
- A node-based ILP formulation for the node-weighted dominating Steiner problem
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)
- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
Uses Software
This page was built for publication: Strong Formulations for 2-Node-Connected Steiner Network Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505657)
