A local branching heuristic for the capacitated fixed-charge network design problem
From MaRDI portal
Publication:1038297
DOI10.1016/j.cor.2008.09.003zbMath1175.90072OpenAlexW2027918977MaRDI QIDQ1038297
Inmaculada Rodríguez-Martín, Juan-José Salazar-González
Publication date: 17 November 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.09.003
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (19)
A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design ⋮ 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 ⋮ Matheuristics for the single-path design-balanced service network design problem ⋮ A cutting plane algorithm for the capacitated connected facility location problem ⋮ New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design 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 ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ Service network design models for two-tier city logistics ⋮ MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem ⋮ Generalized local branching heuristics and the capacitated ring tree problem ⋮ Warm-start heuristic for stochastic portfolio optimization with fixed and proportional transaction costs ⋮ A local branching heuristic for the open pit mine production scheduling 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 ⋮ 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
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Local branching
- 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
- A branch-and-cut algorithm for capacitated network design problems
- Variable neighborhood search and local branching
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Capacitated Network Design—Polyhedral Structure and Computation
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
This page was built for publication: A local branching heuristic for the capacitated fixed-charge network design problem
