An Approzimation Algorithm for the K-Level Facility Location Problem with Submodular Penalties

摘要：

In this paper, we consider the k-level facility location problem with submodular penalties (k-FLPSP). We propose a primal-dual 6-approximation (combinatorial) algorithm for the k-FLPSP.

关键词： Facility location problem submodular function approzimation algorithm

作者: Gaidi Li Zhen Wang Dachuan Xu

作者单位: Department of Applied Mathematics, Beijing University of Technology, Beijing 100124, China

会议类型: 国际会议

会议名称: The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)

会议地点: 长沙

会议语种:英文

页码: 772-777

在线出版日期: 2009-06-01（万方平台首次上网日期，不代表论文的发表时间）