Metric inequalities and the network loading problem
From MaRDI portal
Publication:2471279
DOI10.1016/J.DISOPT.2006.10.002zbMath1173.90333OpenAlexW1968016922MaRDI QIDQ2471279
Sara Mattia, Antonio Sassano, Pasquale Avella
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 (27)
Exact approaches to the single-source network loading problem ⋮ Survivable network design with shared-protection routing ⋮ The robust network loading problem with dynamic routing ⋮ Robust Metric Inequalities for Network Loading Under Demand Uncertainty ⋮ Near optimal design of wavelength routed optical networks ⋮ Energy-aware survivable networks ⋮ Unsplittable non-additive capacitated network design using set functions polyhedra ⋮ Network loading problem: valid inequalities from 5- and higher partitions ⋮ A partitioning algorithm for the network loading problem ⋮ Robust network design: Formulations, valid inequalities, and computations ⋮ Benders decomposition approach for the robust network design problem with flow bifurcations ⋮ A polyhedral study of the capacity formulation of the multilayer network design problem ⋮ New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem ⋮ Separating tight metric inequalities by bilevel programming ⋮ Fixed charge multicommodity network design using \(p\)-partition facets ⋮ Solving survivable two-layer network design problems by metric inequalities ⋮ A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation ⋮ Polyhedral structure of the 4-node network design problem ⋮ Towards optimizing the deployment of optical access networks ⋮ On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics ⋮ Robust capacity assignment solutions for telecommunications networks with uncertain demands ⋮ Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut ⋮ On cut-based inequalities for capacitated network design polyhedra ⋮ Benders Decomposition for Capacitated Network Design ⋮ An improved Benders decomposition applied to a multi-layer network design problem ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality ⋮ An exact approach for the multicommodity network optimization problem with a step cost function
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
This page was built for publication: Metric inequalities and the network loading problem
