An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem

DOI10.1007/S10479-008-0343-0MaRDI QIDQ2271817zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

branch and bounduncapacitated facility location problemdual ascent algorithmduallocpdloc

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

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)

Cites work

• scientific article; zbMATH DE number 4202014 (Why is no real title available?)
• scientific article; zbMATH DE number 3568354 (Why is no real title available?)
• A Dual-Based Procedure for Uncapacitated Facility Location
• A hybrid multistart heuristic for the uncapacitated facility location problem
• A note on duality gap in the simple plant location problem
• A projection method for the uncapacitated facility location problem
• A simple tabu search for warehouse location
• A tabu search approach to the uncapacitated facility location problem
• An Overview of Representative Problems in Location Research
• Branch and peg algorithms for the simple plant location problem
• Facility location models for distribution system design
• Integer Programming: Methods, Uses, Computations
• Location science research: a review
• Neighborhood search heuristics for the uncapacitated facility location problem
• On the exact solution of large-scale simple plant location problems
• Solving the simple plant location problem by genetic algorithm
• Solving the simple plant location problem using a data correcting approach
• Strategic facility location: A review

Cited in

(7)

• Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
• scientific article; zbMATH DE number 764450 (Why is no real title available?)
• An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
• On a class of subadditive duals for the uncapacitated facility location problem
• Optimal algorithms for some inverse uncapacitated facility location problems on networks
• An improved Lagrangian relaxation and dual ascent approach to facility location problems
• Matheuristics: survey and synthesis

Describes a project that uses

Uses Software

• OR-Library

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)