A capacity scaling heuristic for the multicommodity capacitated network design problem
From MaRDI portal
Publication:837097
DOI10.1016/J.CAM.2008.10.055zbMATH Open1178.90057OpenAlexW2007402232MaRDI QIDQ837097FDOQ837097
Authors: N. E. Zubov 
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
Recommendations
- A combined capacity scaling and local branching approach for capacitated multi-commodity network design problem
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- scientific article; zbMATH DE number 1264406
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
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)
Cites Work
- A dual ascent approach to the fixed-charge capacitated network design problem
- The convex hull of two core capacitated network design problems
- Network Design Using Cut Inequalities
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- Tailoring Benders decomposition for uncapacitated network design
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Scatter search for network design problem
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- A general heuristic for production planning problems
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
Cited In (21)
- MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
- Algorithms for the one-dimensional two-stage cutting stock problem
- Heuristics for capacity planning problems with congestion
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- A cutting plane algorithm for the capacitated connected facility location problem
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem
- The transit time constrained fixed charge multi-commodity network design problem
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- 0-1 reformulations of the multicommodity capacitated network design problem
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
- Service network design models for two-tier city logistics
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
This page was built for publication: A capacity scaling heuristic for the multicommodity capacitated network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837097)
