摘要

In this paper a general k-level uncapacitated facility location problem(k-GLUFLP) is proposed. It is shown that the 2-level uncapacitated facility location problem with no fixed cost(2-GLUFLNP) is strong NP-complete and a heuristic algorithm with worst case ratio of 3/2 is given for 2-GLUFLNP when the service costs are assumed to be in the metric space. We also present a randomized 3-approximation algorithm for the k-GLUFLP, when k is a fixed integer.