An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
DOI10.1007/S10479-008-0343-0zbMATH Open1169.90387OpenAlexW2011429203WikidataQ57910821 ScholiaQ57910821MaRDI QIDQ2271817FDOQ2271817
Authors: 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
Recommendations
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- scientific article; zbMATH DE number 1187151
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- An incremental algorithm for the uncapacitated facility location problem
- scientific article; zbMATH DE number 2086926
- A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem
- An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties
- Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Cites Work
- 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 by genetic algorithm
- A simple tabu search for warehouse location
- Facility location models for distribution system design
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Title not available (Why is that?)
- Integer Programming: Methods, Uses, Computations
- Strategic facility location: A review
- Location science research: a review
- A Dual-Based Procedure for Uncapacitated Facility Location
- Title not available (Why is that?)
- An Overview of Representative Problems in Location Research
- A projection method for the uncapacitated facility location problem
- A note on duality gap in the simple plant location problem
- Solving the simple plant location problem using a data correcting approach
- Branch and peg algorithms for the simple plant location problem
Cited In (7)
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- Matheuristics: survey and synthesis
- On a class of subadditive duals for the uncapacitated facility location problem
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- 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
- Title not available (Why is that?)
Uses Software
This page was built for publication: An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2271817)
