A capacity scaling heuristic for the multicommodity capacitated network design problem
From MaRDI portal
Publication:837097
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
Cites work
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- 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 dual ascent approach to the fixed-charge capacitated network design problem
- A first multilevel cooperative algorithm for 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
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Network Design Using Cut Inequalities
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Scatter search for network design problem
- Tailoring Benders decomposition for uncapacitated network design
- The convex hull of two core capacitated network design problems
Cited in
(23)- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- A combined capacity scaling and local branching matheuristic for the hop-constrained multicommodity network design problem
- The transit time constrained fixed charge multi-commodity network design problem
- Heuristics for capacity planning problems with congestion
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
- 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
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- A combined matheuristic for the piecewise linear multicommodity network flow problem
- A cutting plane algorithm for the capacitated connected facility location problem
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- 0-1 reformulations of the multicommodity capacitated network design problem
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Algorithms for the one-dimensional two-stage cutting stock 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
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
- Service network design models for two-tier city logistics
- A combined capacity scaling and local branching approach for capacitated multi-commodity network design problem
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
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)
