A note on the maximization version of the multi-level facility location problem

Authors:
Jiawei Zhang;Yinyu Ye
Affiliations:
Department of Management Sciences, University of Iowa, Iowa City, IA 52242, USA;Department of Management Science and Engineering, Stanford University, Stanford, CA 94305-4026, USA
Venue:
Operations Research Letters
Year:
2002

Citing 4
Cited 5

An 0.828–approximation algorithm for the uncapacitated facility location problem

Discrete Applied Mathematics
A 3-approximation algorithm for the k-level uncapacitated facility location problem

Information Processing Letters
Improved Approximation Algorithms for Metric Facility Location Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
An approximation algorithm for the maximization version of the two level uncapacitated facility location problem

Operations Research Letters

Approximating the two-level facility location problem via a quasi-greedy approach

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A review of hierarchical facility location models

Computers and Operations Research
The vendor location problem

Computers and Operations Research
Approximation algorithm for facility location with service installation costs

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

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the maximization version of the multi-level facility location problem can be approximated by a factor of 0.5. The only previously known result is a factor of 0.47 for the two-level case obtained recently by Bumb (Oper. Res. Lett. 29(4) (2001) 155).