Pages that link to "Item:Q2630091"
From MaRDI portal
The following pages link to Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091):
Displaying 16 items.
- Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
- An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) (← links)
- Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
- Approximation algorithms for two variants of correlation clustering problem (Q2156281) (← links)
- LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
- Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce (Q2419538) (← links)
- An approximation algorithm for the dynamic facility location problem with outliers (Q2421446) (← links)
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation (Q3186508) (← links)
- Constant-Factor FPT Approximation for Capacitated k-Median (Q5075732) (← links)
- Constant factor approximation algorithm for uniform hard capacitated knapsack median problem (Q5090959) (← links)
- On the cost of essentially fair clusterings (Q5875470) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5918631) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5970810) (← links)
