An approximation algorithm for the k-level capacitated facility location problem
From MaRDI portal
Publication:613660
DOI10.1007/S10878-009-9213-1zbMATH Open1206.90072OpenAlexW2083833523MaRDI QIDQ613660FDOQ613660
Authors: Xing Wang, Donglei Du, Dachuan Xu 
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
Recommendations
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties
- Approximation algorithms for the dynamic \(k\)-level facility location problems
- A new approximation algorithm for the \(k\)-facility location problem
- Theory and Applications of Models of Computation
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- scientific article; zbMATH DE number 2038706
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities
- Approximation schemes for \(k\)-facility location
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- Approximating the two-level facility location problem via a quasi-greedy approach
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Greedy Strikes Back: Improved Facility Location Algorithms
- Title not available (Why is that?)
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Title not available (Why is that?)
- The \(k\)-level facility location game
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- Algorithms - ESA 2003
- Title not available (Why is that?)
- Integer Programming and Combinatorial Optimization
- Approximation Algorithms for Metric Facility Location Problems
- Approximation algorithm for facility location with service installation costs
Cited In (28)
- Approximation algorithms for the stochastic priority facility location problem
- An approximation algorithm for the \(k\)-level facility location problem with submodular penalties
- Title not available (Why is that?)
- An approximation algorithm for the dynamic facility location problem with submodular penalties
- A General k-Level Uncapacitated Facility Location Problem
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- An approximation algorithm for the \(k\)-level concentrator location problem
- Exactly solving a two-level location problem with modular node capacities
- A new approximation algorithm for the multilevel facility location problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- Multi-level facility location problems
- An approximation algorithm for the \(k\)-level facility location problem with outliers
- Inapproximability of the multilevel uncapacitated facility location problem
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- Approximation algorithms for the priority facility location problem with penalties
- A cross-monotonic cost sharing method for the facility location game with service installation costs
- Improved LP-rounding approximation algorithm for \(k\)-level uncapacitated facility location
- Approximation algorithm for resource allocation problems with time dependent penalties
- Inapproximability of the multi-level uncapacitated facility location problem
- An approximation algorithm for the dynamic \(k\)-level facility location problem
- An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space
- An approximation algorithm for the \(k\)-level stochastic facility location problem
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities
- 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 algorithms for \(k\)-level stochastic facility location problems
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
This page was built for publication: An approximation algorithm for the \(k\)-level capacitated facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613660)
