Metric inequalities and the network loading problem
From MaRDI portal
Publication:2471279
Recommendations
- Integer Programming and Combinatorial Optimization
- Separating tight metric inequalities by bilevel programming
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Network loading problem: valid inequalities from 5- and higher partitions
- Polyhedral results for the edge capacity polytope.
Cites work
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A branch-and-cut algorithm for capacitated network design problems
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A polyhedral approach to multicommodity survivable network design
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- Approximating fractional multicommodity flow independent of the number of commodities
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Capacitated Network Design—Polyhedral Structure and Computation
- Geometry of cuts and metrics
- scientific article; zbMATH DE number 1263272 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- scientific article; zbMATH DE number 1175958 (Why is no real title available?)
- scientific article; zbMATH DE number 3354799 (Why is no real title available?)
- Minimum cost capacity installation for multicommodity network flows
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- On capacitated network design cut-set polyhedra
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- On the membership problem for the elementary closure of a polyhedron
- On the separation of maximally violated mod-\(k\) cuts
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Source sink flows with capacity installation in batches
- Totally tight Chvatal-Gomory cuts
Cited in
(30)- An improved Benders decomposition applied to a multi-layer network design problem
- Minimum cost capacity installation for multicommodity network flows
- Network loading problem: valid inequalities from 5- and higher partitions
- Fixed charge multicommodity network design using p-partition facets
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Metric inequalities for routings on direct connections with application to line planning
- Separating tight metric inequalities by bilevel programming
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- The robust network loading problem with dynamic routing
- Towards optimizing the deployment of optical access networks
- A partitioning algorithm for the network loading problem
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- Benders decomposition for capacitated network design
- Exact approaches to the single-source network loading problem
- Survivable network design with shared-protection routing
- Polyhedral structure of the 4-node network design problem
- On cut-based inequalities for capacitated network design polyhedra
- Near optimal design of wavelength routed optical networks
- Energy-aware survivable networks
- Unsplittable non-additive capacitated network design using set functions polyhedra
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Solving survivable two-layer network design problems by metric inequalities
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- An exact approach for the multicommodity network optimization problem with a step cost function
- 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
- Integer Programming and Combinatorial Optimization
This page was built for publication: Metric inequalities and the network loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471279)
