An approximation algorithm for soft capacitated k-facility location problem
From MaRDI portal
An approximation algorithm for soft capacitated \(k\)-facility location problem
Recommendations
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- An approximation algorithm for the soft-capacitated dynamic facility location problem
- An improved approximation algorithm for the k-level facility location problem with soft capacities
- Improved approximation of the general soft-capacitated facility location problem
- Approximation algorithms for hard capacitated \(k\)-facility location problems
Cites work
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- A 3-approximation for facility location with uniform capacities
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- A new approximation algorithm for the \(k\)-facility location problem
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
- An approximation algorithm for uniform capacitated \(k\)-median problem with \(1+\epsilon\) capacity violation
- Approximating \(k\)-median with non-uniform capacities
- Approximating capacitated \(k\)-median with \((1 + \epsilon)k\) open facilities
- Approximating k-median via pseudo-approximation
- Approximation Algorithms for Metric Facility Location Problems
- Approximation algorithms for NP-hard problems.
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- Bi-factor approximation algorithms for hard capacitated \(k\)-median problems
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- On uniform capacitated \(k\)-median beyond the natural LP relaxation
Cited in
(11)- Approximation schemes for \(k\)-facility location
- Approximation algorithms for the robust/soft-capacitated 2-level facility location problems
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem
- Approximating soft-capacitated facility location problem with uncertainty
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Improved approximation of the general soft-capacitated facility location problem
- scientific article; zbMATH DE number 6263680 (Why is no real title available?)
- An approximation algorithm for the soft-capacitated dynamic facility location problem
- Approximation algorithms for hard capacitated \(k\)-facility location problems
This page was built for publication: An approximation algorithm for soft capacitated \(k\)-facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702830)
