MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
From MaRDI portal
Publication:5149549
Recommendations
- A cutting-plane neighborhood structure for fixed-charge capacitated multicommodity network design problem
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Scatter search for network design problem
- A dual ascent approach to the fixed-charge capacitated network design problem
Cites work
- A branch-and-cut algorithm for capacitated network design problems
- A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- A combined capacity scaling and local branching approach for capacitated multi-commodity network design problem
- A cutting-plane neighborhood structure for fixed-charge capacitated multicommodity network design problem
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- A general heuristic for production planning problems
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- Accelerating the Benders decomposition method: application to stochastic network design problems
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Capacitated Network Design—Polyhedral Structure and Computation
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Local branching
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- On capacitated network design cut-set polyhedra
- On cut-based inequalities for capacitated network design polyhedra
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Scatter search for network design problem
Cited in
(14)- A dual ascent approach to the fixed-charge 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
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- A cutting-plane neighborhood structure for fixed-charge capacitated multicommodity network design problem
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
- A combined capacity scaling and local branching approach for capacitated multi-commodity network design problem
- A scatter search heuristic for the fixed-charge capacitated network design problem
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- scientific article; zbMATH DE number 1187079 (Why is no real title available?)
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
- Scatter search for network design problem
This page was built for publication: MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149549)
