An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
From MaRDI portal
Publication:2271817
DOI10.1007/s10479-008-0343-0zbMath1169.90387OpenAlexW2011429203WikidataQ57910821 ScholiaQ57910821MaRDI QIDQ2271817
Jaroslav Janáček, L'uboš Buzna
Publication date: 4 August 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0343-0
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (6)
Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Matheuristics: survey and synthesis ⋮ On a class of subadditive duals for the uncapacitated facility location problem ⋮ Semi-Lagrangian relaxation applied to the uncapacitated facility location problem ⋮ An application of a Lagrangian-type relaxation for the uncapacitated facility location problem ⋮ An improved Lagrangian relaxation and dual ascent approach to facility location problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A simple tabu search for warehouse location
- Facility location models for distribution system design
- A note on duality gap in the simple plant location problem
- A hybrid multistart heuristic for the uncapacitated facility location problem
- A projection method for the uncapacitated facility location problem
- On the exact solution of large-scale simple plant location problems
- A tabu search approach to the uncapacitated facility location problem
- Neighborhood search heuristics for the uncapacitated facility location problem
- Solving the simple plant location problem using a data correcting approach
- Location science research: a review
- Branch and peg algorithms for the simple plant location problem
- Strategic facility location: A review
- Solving the simple plant location problem by genetic algorithm
- An Overview of Representative Problems in Location Research
- A Dual-Based Procedure for Uncapacitated Facility Location
- Integer Programming: Methods, Uses, Computations
This page was built for publication: An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
