Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice

DOI10.1007/S10107-010-0375-5zbMath1198.90335DBLPjournals/mp/ChimaniKLM10OpenAlexW1970767312WikidataQ56977123 ScholiaQ56977123MaRDI QIDQ2638387

Maria Kandyba, Markus Chimani, Ivana Ljubić, Petra Mutzel

Publication date: 16 September 2010

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-010-0375-5

zbMATH Keywords

branch and cutgraph orientationILP formulations2-connected networks

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (6)

Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems ⋮ Branch-and-cut methods for the network design problem with vulnerability constraints ⋮ Comparison of formulations for the inventory routing problem ⋮ Finding Totally Independent Spanning Trees with Linear Integer Programming ⋮ Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties ⋮ Stochastic survivable network design problems: theory and practice

Uses Software

• SteinLib
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum-weight two-connected spanning networks
• 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
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
• 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
• Solving Steiner tree problems in graphs to optimality
• Strong formulations for network design problems with connectivity requirements
• A catalog of steiner tree formulations
• Design of Survivable Networks: A survey
• A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks
• Obtaining optimal k -cardinality trees fast
• 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

This page was built for publication: Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice