A capacity scaling heuristic for the multicommodity capacitated network design problem
From MaRDI portal
Publication:837097
DOI10.1016/j.cam.2008.10.055zbMath1178.90057OpenAlexW2007402232MaRDI QIDQ837097
Publication date: 10 September 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2008.10.055
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Applications of design theory to circuits and networks (94C30)
Related Items (17)
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design ⋮ A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem ⋮ A parallel local search framework for the fixed-charge multicommodity network flow problem ⋮ A cutting plane algorithm for the capacitated connected facility location problem ⋮ The transit time constrained fixed charge multi-commodity network design problem ⋮ Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods ⋮ Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows ⋮ A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem ⋮ Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows ⋮ Service network design models for two-tier city logistics ⋮ MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem ⋮ Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design ⋮ Lagrangean relaxation heuristics for the \(p\)-cable-trench problem ⋮ Algorithms for the one-dimensional two-stage cutting stock problem ⋮ Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design ⋮ Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
Cites Work
- The convex hull of two core capacitated network design problems
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Scatter search for network design problem
- A dual ascent approach to the fixed-charge capacitated network design problem
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- A General Heuristic for Production Planning Problems
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Tailoring Benders decomposition for uncapacitated network design
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Network Design Using Cut Inequalities
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
This page was built for publication: A capacity scaling heuristic for the multicommodity capacitated network design problem
