A 3-approximation for facility location with uniform capacities
From MaRDI portal
Publication:3569815
Recommendations
- A 3-approximation algorithm for the facility location problem with uniform capacities
- A local search approximation algorithm for the uniform capacitated k-facility location problem
- scientific article; zbMATH DE number 1342123
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
Cited in
(12)- Combinatorial approximation algorithms for the robust facility location problem with penalties
- A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties
- Improved local search for universal facility location
- New approximation algorithms for the unsplittable capacitated facility location problem
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- A 3-approximation algorithm for the facility location problem with uniform capacities
- Capacitated facility location with outliers/penalties
- Local search algorithm for universal facility location problem with linear penalties
- A local search approximation algorithm for the uniform capacitated k-facility location problem
- An approximation algorithm for soft capacitated k-facility location problem
- Improved approximation algorithm for universal facility location problem with linear penalties
- Approximation algorithms for the transportation problem with market choice and related models
This page was built for publication: A 3-approximation for facility location with uniform capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569815)