A note on capacity models for network design
From MaRDI portal
Publication:2417179
DOI10.1016/j.orl.2018.05.002OpenAlexW2804192059MaRDI QIDQ2417179
Publication date: 11 June 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.10147
Cites Work
- The convex hull of two core capacitated network design problems
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Minimum cost capacity installation for multicommodity network flows
- Projections of the capacitated network loading problem
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- A branch-and-cut algorithm for capacitated network design problems
- On capacitated network design cut-set polyhedra
- On cut-based inequalities for capacitated network design polyhedra
- Network design arc set with variable upper bounds
- Solving the two‐facility network design problem with 3‐partition facets
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Domination Between Traffic Matrices
- k-Partition-based facets of the network design problem
- Capacitated Network Design—Polyhedral Structure and Computation
- Valid inequalities for problems with additive variable upper bounds
This page was built for publication: A note on capacity models for network design
