| Article ID: | iaor20031541 |
| Country: | Netherlands |
| Volume: | 30 |
| Issue: | 5 |
| Start Page Number: | 327 |
| End Page Number: | 332 |
| Publication Date: | Oct 2002 |
| Journal: | Operations Research Letters |
| Authors: | Ageev A.A. |
| Keywords: | location |
We show that the metric multilevel facility location problem is polynomial-time reducible within a factor of 3 to the metric uncapacitated facility location problem. This leads to a combinatorial 4.83-approximation algorithm for the metric multilevel facility location problem and to a 9-approximation algorithm for a capacitated version of it.