Metric inequalities and the network loading problem
From MaRDI portal
Publication:2471279
DOI10.1016/j.disopt.2006.10.002zbMath1173.90333MaRDI QIDQ2471279
Pasquale Avella, Antonio Sassano, Sara Mattia
Publication date: 22 February 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.10.002
Related Items
An improved Benders decomposition applied to a multi-layer network design problem, A partitioning algorithm for the network loading problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the membership problem for the elementary closure of a polyhedron
- Source sink flows with capacity installation in batches
- Minimum cost capacity installation for multicommodity network flows
- A polyhedral approach to multicommodity survivable network design
- Potential function methods for approximately solving linear programming problems: theory and practice.
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Totally tight Chvatal-Gomory cuts
- A branch-and-cut algorithm for capacitated network design problems
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- On capacitated network design cut-set polyhedra
- On the separation of maximally violated mod-\(k\) cuts
- Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- Capacitated Network Design—Polyhedral Structure and Computation
- Geometry of cuts and metrics
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
