Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
From MaRDI portal
Publication:2077967
Recommendations
- LP extreme points and cuts for the fixed-charge network design problem
- Fixed charge multicommodity network design using p-partition facets
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- On two new formulations for the fixed charge network design problem with shortest path constraints
- The generalized fixed-charge network design problem
Cites work
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- A survey on Benders decomposition applied to fixed-charge network design problems
- Accelerating Benders decomposition with heuristic master problem solutions
- Algorithms – ESA 2005
- An implementation of exact knapsack separation
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Capacitated Network Design—Polyhedral Structure and Computation
- Combinatorial approaches to multiflow problems
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Design of survivable networks using three- and four-partition facets
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Exact solution of multicommodity network optimization problems with general step cost functions
- Fenchel Cutting Planes for Integer Programs
- Fixed charge multicommodity network design using p-partition facets
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1361558 (Why is no real title available?)
- k-Partition-based facets of the network design problem
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- Metric inequalities and the network loading problem
- Minimum cost capacity installation for multicommodity network flows
- Multi-objective routing within large scale facilities using open finite queueing networks
- Network Design Using Cut Inequalities
- Network loading problem: valid inequalities from 5- and higher partitions
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Revisiting Lagrangian relaxation for network design
- Separation algorithms for 0-1 knapsack polytopes
- Solving the two‐facility network design problem with 3‐partition facets
- The convex hull of two core capacitated network design problems
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
Cited in
(3)- Train stop scheduling problem: an exact approach using valid inequalities and polar duality
- Vehicle routing problem with time windows -- new valid inequalities from polar duality
- Fiber-to-the-home passive optical distribution network design: a new formulation and valid inequalities using polar duality
This page was built for publication: Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2077967)
