A General k-Level Uncapacitated Facility Location Problem

Rongheng Li,Huei Chuen Huang

ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF CONTEMPORARY INTELLIGENT COMPUTING TECHNIQUES（2008）

引用 2|浏览2

暂无评分

摘要

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.

查看译文

关键词

Approximation algorithm,Facility location,Complexity,k-level

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要