A new approximation algorithm for the multilevel facility location problem

Authors:
Adriana F. Gabor;Jan-Kees C. W. van Ommeren
Affiliations:
Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands;Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 17
Cited 5

Randomized algorithms

Randomized algorithms
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
A 3-approximation algorithm for the k-level uncapacitated facility location problem

Information Processing Letters
Analysis of a local search heuristic for facility location problems

Journal of Algorithms
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Local search heuristic for k-median and facility location problems

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Cost-distance: two metric network design

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Approximation algorithms for the multi-level facility location problem

Approximation algorithms for the multi-level facility location problem
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Journal of the ACM (JACM)
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

SIAM Journal on Computing
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem

SIAM Journal on Discrete Mathematics
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
Improved approximation algorithms for multilevel facility location problems

Operations Research Letters

A primal-dual approximation algorithm for the k-level stochastic facility location problem

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
The vendor location problem

Computers and Operations Research
Inapproximability of the multi-level uncapacitated facility location problem

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An approximation algorithm for the k-level stochastic facility location problem

Operations Research Letters
Survey: Hierarchical facility location problem: Models, classifications, techniques, and applications

Computers and Industrial Engineering

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP-rounding. The linear program that we use has a polynomial number of variables and constraints, thus being more efficient than the one commonly used in the approximation algorithms for these types of problems.