Lower-bounded facility location
From MaRDI portal
Publication:2930351
DOI10.1145/1824777.1824789zbMath1300.90016OpenAlexW2154044080MaRDI QIDQ2930351
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1824777.1824789
No records found.
No records found.
Related Items (12)
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems ⋮ A distribution network design problem in the automotive industry: MIP formulation and heuristics ⋮ Approximation algorithms for the lower bounded correlation clustering problem ⋮ Improved bounds for metric capacitated covering problems ⋮ On coresets for fair clustering in metric and Euclidean spaces and their applications ⋮ Respecting lower bounds in uniform lower and upper bounded facility location problem ⋮ Approximate the lower-bounded connected facility location problem ⋮ On the cost of essentially fair clusterings ⋮ A unified framework of FPT approximation algorithms for clustering problems ⋮ Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem ⋮ Approximation algorithms for the lower-bounded \(k\)-median and its generalizations ⋮ Approximation algorithms for the lower-bounded knapsack median problem
This page was built for publication: Lower-bounded facility location
