Local search algorithm for universal facility location problem with linear penalties
From MaRDI portal
Publication:506471
Recommendations
- A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties
- Improved approximation algorithm for universal facility location problem with linear penalties
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
- Algorithms - ESA 2003
- Improved local search for universal facility location
Cites work
- scientific article; zbMATH DE number 1342123 (Why is no real title available?)
- A 3-approximation for facility location with uniform capacities
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A cost-sharing method for the multi-level economic lot-sizing game
- Algorithms - ESA 2003
- Algorithms for facility location problems with outliers. (Extended abstract)
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- An approximation algorithm for the \(k\)-median warehouse-retailer network design problem
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- Analysis of a Local Search Heuristic for Facility Location Problems
- From stars to comets: improved local search for universal facility location
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- Improved approximation for universal facility location
- Improved local search for universal facility location
- LP-based algorithms for capacitated facility location
- Network flows. Theory, algorithms, and applications.
Cited in
(8)- Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques
- Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties
- Improved approximation algorithm for universal facility location problem with linear penalties
- Effective Heuristic Techniques for Combined Robust Clustering Problem
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
- A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties
- Approximation algorithms for the individually fair \(k\)-center with outliers
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space
This page was built for publication: Local search algorithm for universal facility location problem with linear penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506471)
