A branch and bound algorithm for the partial coverage capacitated plant location problem
From MaRDI portal
Publication:1021019
DOI10.1007/BF03398810zbMath1178.90214MaRDI QIDQ1021019
Publication date: 5 June 2009
Published in: Opsearch (Search for Journal in Brave)
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B80: Discrete location and assignment
Cites Work
- Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Capacitated facility location problem with general setup cost
- An LP-based heuristic for two-stage capacitated facility location problems
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- An Improved Algorithm for the Capacitated Facility Location Problem
- A large-scale application of the partial coverage uncapacitated facility location problem
- A branch‐bound algorithm for the capacitated facilities location problem
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem