Add/drop procedures for the capacitated plant location problem
From MaRDI portal
Recommendations
- ADD-heuristics' starting procedures for capacitated plant location models
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- scientific article; zbMATH DE number 4010185
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- A heuristic preprocessor supported algorithm for the capacitated plant location problem
Cites work
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A Cross Decomposition Algorithm for Capacitated Facility Location
- An algorithm for solving large capacitated warehouse location problems
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- Dominance Criteria for the Capacitated Warehouse Location Problem
- Heuristics for the capacitated plant location model
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- Lagrangean heuristics for location problems
Cited in
(6)- ADD-heuristics' starting procedures for capacitated plant location models
- A heuristic preprocessor supported algorithm for the capacitated plant location problem
- An integrated approach to dynamic plant location and capacity planning
- Some Add-Drop and Drop-Add Interchange Heuristics for Non-Linear Warehouse Location
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- Subdrop: A modified drop heuristic for location problems
This page was built for publication: Add/drop procedures for the capacitated plant location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741478)
