Capacitated facility location with outliers/penalties
From MaRDI portal
Publication:6168979
DOI10.1007/978-3-031-22105-7_49arXiv2012.07135OpenAlexW4313343286MaRDI QIDQ6168979
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.07135
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LP-based approximation algorithms for capacitated facility location
- Local search algorithms for the red-blue median problem
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- A constant-factor approximation algorithm for the k -median problem (extended abstract)
- A 5-Approximation for Capacitated Facility Location
- Constant Factor Approximation for Capacitated k-Center with Outliers
- LP-Based Algorithms for Capacitated Facility Location
- A 3-Approximation for Facility Location with Uniform Capacities
- Approximating capacitated k-median with (1 + ∊)k open facilities
- Approximation Schemes for Clustering with Outliers
- Constant factor approximation algorithm for uniform hard capacitated knapsack median problem
- Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
- Capacitated facility location with outliers/penalties
This page was built for publication: Capacitated facility location with outliers/penalties
