The facility location problem with maximum distance constraint

DOI10.1016/J.IPL.2023.106447MaRDI QIDQ6121428zbMATH OpenFDO

Authors Xiaowei Li, Xiwen Lu

Publication date 26 March 2024

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IPL.2023.106447

zbMATH Keywords

\(k\)-supplier problemapproximation algorithmsfacility location problemNP-hard

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A 1.488 approximation algorithm for the uncapacitated facility location problem
• A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
• A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
• A new greedy approach for facility location problems
• A primal-dual approximation algorithm for the facility location problem with submodular penalties
• A simple dual ascent algorithm for the multilevel facility location problem
• Algorithms for facility location problems with outliers. (Extended abstract)
• An approximation algorithm for stochastic multi-level facility location problem with soft capacities
• An approximation algorithm for the k-level facility location problem with outliers
• An improved approximation algorithm for the k-level facility location problem with soft capacities
• An improved approximation algorithm for uncapacitated facility location problem with penalties
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Approximation Algorithms for Metric Facility Location Problems
• Approximation algorithms for the dynamic \(k\)-level facility location problems
• Efficient probabilistically checkable proofs and applications to approximations
• Greedy Strikes Back: Improved Facility Location Algorithms
• Hedging uncertainty: approximation algorithms for stochastic optimization problems
• scientific article; zbMATH DE number 1559542 (Why is no real title available?)
• Improved approximation algorithms for capacitated facility location problems
• Improved approximation algorithms for the facility location problems with linear/submodular penalties
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
• Local Search Heuristics for k-Median and Facility Location Problems
• LP-based algorithms for capacitated facility location
• Path relinking approach for multiple allocation hub maximal covering problem
• Reducibility among combinatorial problems

Cited in

(1)

• A polynomial-time exact algorithm for the connected k-facility location problem on trees

This page was built for publication: The facility location problem with maximum distance constraint

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