An approximation algorithm for the \(k\)-level capacitated facility location problem
From MaRDI portal
Publication:613660
DOI10.1007/s10878-009-9213-1zbMath1206.90072OpenAlexW2083833523MaRDI QIDQ613660
Xing Wang, Da-Chuan Xu, Dong-lei Du
Publication date: 21 December 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-009-9213-1
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (11)
Exactly solving a two-level location problem with modular node capacities ⋮ An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space ⋮ An approximation algorithm for the dynamic facility location problem with submodular penalties ⋮ A primal-dual approximation algorithm for the facility location problem with submodular penalties ⋮ Approximation algorithms for the priority facility location problem with penalties ⋮ A primal-dual approximation algorithm for stochastic facility location problem with service installation costs ⋮ Approximation algorithms for the dynamic \(k\)-level facility location problems ⋮ Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties ⋮ Multi-level facility location problems ⋮ A cross-monotonic cost sharing method for the facility location game with service installation costs ⋮ Approximation algorithms for the stochastic priority facility location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithm for facility location with service installation costs
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- The \(k\)-level facility location game
- Approximating the two-level facility location problem via a quasi-greedy approach
- Approximation Algorithms for Metric Facility Location Problems
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- Integer Programming and Combinatorial Optimization
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Algorithms - ESA 2003
This page was built for publication: An approximation algorithm for the \(k\)-level capacitated facility location problem
