Lower-bounded facility location
From MaRDI portal
Recommendations
Cited in
(21)- On facility location with general lower bounds
- Approximation algorithms for clustering problems with lower bounds and outliers
- On coresets for fair clustering in metric and Euclidean spaces and their applications
- On coresets for fair clustering in metric and Euclidean spaces and their applications
- A unified framework of FPT approximation algorithms for clustering problems
- Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
- On the cost of essentially fair clusterings
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
- Achieving anonymity via weak lower bound constraints for k-median and k-means
- A distribution network design problem in the automotive industry: MIP formulation and heuristics
- Approximation algorithms for the lower-bounded knapsack median problem
- Connected k-center and k-diameter clustering
- Improved approximation guarantees for lower-bounded facility location
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- Approximate the lower-bounded connected facility location problem
- Heterogeneous facility location with limited resources
- Approximating connected facility location with lower and upper bounds via LP rounding
- Respecting lower bounds in uniform lower and upper bounded facility location problem
- Improved bounds for metric capacitated covering problems
- Approximation algorithms for the lower bounded correlation clustering problem
This page was built for publication: Lower-bounded facility location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930351)
