Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
From MaRDI portal
Publication:2077967
DOI10.1016/j.ejor.2021.08.043zbMath1495.90037OpenAlexW3199547674MaRDI QIDQ2077967
Sachin Jayaswal, Y. K. Agarwal, Yash P. Aneja
Publication date: 23 February 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.08.043
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- An implementation of exact knapsack separation
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- The convex hull of two core capacitated network design problems
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- Combinatorial approaches to multiflow problems
- Minimum cost capacity installation for multicommodity network flows
- Exact solution of multicommodity network optimization problems with general step cost functions
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Network loading problem: valid inequalities from 5- and higher partitions
- Fixed charge multicommodity network design using \(p\)-partition facets
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- A survey on Benders decomposition applied to fixed-charge network design problems
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Multi-objective routing within large scale facilities using open finite queueing networks
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Revisiting Lagrangian relaxation for network design
- Metric inequalities and the network loading problem
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Separation algorithms for 0-1 knapsack polytopes
- Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- Fenchel Cutting Planes for Integer Programs
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Solving the two‐facility network design problem with 3‐partition facets
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Network Design Using Cut Inequalities
- Accelerating benders decomposition with heuristicmaster problem solutions
- Design of Survivable Networks Using Three- and Four-Partition Facets
- k-Partition-based facets of the network design problem
- Algorithms – ESA 2005
- Capacitated Network Design—Polyhedral Structure and Computation
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
