A new approximation algorithm for the multilevel facility location problem

https://doi.org/10.1016/j.dam.2009.11.007Get rights and content
Under an Elsevier user license
open archive

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.

Keywords

Facility location
Approximation algorithms
Randomized algorithms

Cited by (0)