Fixed charge multicommodity network design using \(p\)-partition facets
From MaRDI portal
Publication:1698889
DOI10.1016/j.ejor.2016.09.015zbMath1380.90283OpenAlexW2523164219MaRDI QIDQ1698889
Publication date: 16 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.09.015
Mixed integer programming (90C11) Computational aspects related to convexity (52B55) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Related Items
Chvátal-Gomory cuts for the Steiner tree problem, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
Cites Work
- Unnamed Item
- The convex hull of two core capacitated network design problems
- An improved Benders decomposition applied to a multi-layer network design problem
- Combinatorial approaches to multiflow problems
- On the spanning tree polyhedron
- A dual ascent approach to the fixed-charge capacitated network design problem
- Minimum cost capacity installation for multicommodity network flows
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
- Separating tight metric inequalities by bilevel programming
- Metric inequalities and the network loading problem
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
- k-Partition-based facets of the network design problem
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
