Polyhedral structure of the 4-node network design problem
From MaRDI portal
Publication:3057114
DOI10.1002/net.20317zbMath1203.90028OpenAlexW4254784363MaRDI QIDQ3057114
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20317
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Related Items
Survivable network design with shared-protection routing ⋮ Robust Metric Inequalities for Network Loading Under Demand Uncertainty ⋮ Network loading problem: valid inequalities from 5- and higher partitions
Cites Work
- Unnamed Item
- Minimum-weight two-connected spanning networks
- The convex hull of two core capacitated network design problems
- Combinatorial approaches to multiflow problems
- Minimum cost capacity installation for multicommodity network flows
- A polyhedral approach to multicommodity survivable network design
- Telecommunication link restoration planning with multiple facility types
- A branch-and-cut algorithm for capacitated network design problems
- Metric inequalities and the network loading problem
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- Strong formulations for network design problems with connectivity requirements
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- Shortest paths, single origin‐destination network design, and associated polyhedra
- k-Partition-based facets of the network design problem
- Capacitated Network Design—Polyhedral Structure and Computation
- Strong inequalities for capacitated survivable network design problems.
