Improved approximation of the general soft-capacitated facility location problem

DOI10.1051/RO:2007011MaRDI QIDQ4600614zbMATH OpenOpenAlexFDO

Authors Laurent Alfandari

Publication date 12 January 2018

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro:2007011

zbMATH Keywords

dynamic programmingfacility locationFPTASset covering

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An approximation algorithm for soft capacitated k-facility location problem
• An approximation algorithm for the soft-capacitated dynamic facility location problem
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• scientific article; zbMATH DE number 1947060
• An improved approximation algorithm for the k-level facility location problem with soft capacities

Cited in

(8)

• An approximation algorithm for soft capacitated k-facility location problem
• Approximating the \(\tau\)-relaxed soft capacitated facility location problem
• Approximating soft-capacitated facility location problem with uncertainty
• An approximation algorithm for the soft-capacitated dynamic facility location problem
• scientific article; zbMATH DE number 6263680 (Why is no real title available?)
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• An LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
• An LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties

This page was built for publication: Improved approximation of the general soft-capacitated facility location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600614)