Polyhedral structure of the 4-node network design problem
From MaRDI portal
Publication:3057114
DOI10.1002/net.20317zbMath1203.90028MaRDI 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
integer programming; network design; \(k\)-partition; polyhedral structure; multicommodity; facet inequality
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
52A40: Inequalities and extremum problems involving convexity in convex geometry
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.
