An approximation algorithm for the k-level capacitated facility location problem

Authors:
Donglei Du;Xing Wang;Dachuan Xu
Affiliations:
Faculty of Business Administration, University of New Brunswick, Fredericton, Canada E3B 5A3;Department of Applied Mathematics, Beijing University of Technology, Beijing, People's Republic of China 100124;Department of Applied Mathematics, Beijing University of Technology, Beijing, People's Republic of China 100124
Venue:
Journal of Combinatorial Optimization
Year:
2010

Citing 15
Cited 1

Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms

Journal of Algorithms
Analysis of a local search heuristic for facility location problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A 3-approximation algorithm for the k-level uncapacitated facility location problem

Information Processing Letters
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Improved Approximation Algorithms for Capacitated Facility Location Problems

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Facility Location with Nonuniform Hard Capacities

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Journal of the ACM (JACM)
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem

SIAM Journal on Discrete Mathematics
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem

Mathematics of Operations Research
Approximating the two-level facility location problem via a quasi-greedy approach

Mathematical Programming: Series A and B
Approximation Algorithms for Metric Facility Location Problems

SIAM Journal on Computing
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

SIAM Journal on Computing
The k-level facility location game

Operations Research Letters
Approximation algorithm for facility location with service installation costs

Operations Research Letters

A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the k-level capacitated facility location problem (k-CFLP), which is a natural variant of the classical facility location problem and has applications in supply chain management. We obtain the first (combinatorial) approximation algorithm with a performance factor of $k+2+\sqrt{k^{2}+2k+5}+\varepsilon$ (驴0) for this problem.