基于设施选址问题的费用分配问题的近似算法  

Approximation Algorithm for the Cost Allocation Problem Based on the Facility Location Problem

作　　者：王继强[1] 李国君[1] 

机构地区：[1]山东大学数学与系统科学学院

出　　处：《计算机工程与应用》2006年第13期13-14,32,共3页Computer Engineering and Applications

基　　金：国家自然科学基金资助项目(编号:60373025;10271065)

摘　　要：许多有着重要理论和应用价值的最优化问题在算法复杂性上都是NP-hard的,其解决方法之一是近似算法。论文研究了与设施选址问题密切相关的费用分配问题,并利用原始与对偶线性规划的思想和无容量设施选址问题的一个1.52-近似算法[1]给出了该问题的一个更好的近似算法。Many worthwhile optimization problems are NP-hard in algorithmic complexity,one of the solutions of which is approximation algorithm.In this article we consider the cost allocation problem that is closely related to the facility location problem and present an improved approximation algorithm for it.This algorithm uses the idea of primal and dual linear program and a 1.52-approximation algorithm for the uncapacitated facility location problem.

关 键 词：设施选址 费用分配 近似算法 原始与对偶规划 

分 类 号：O224[理学—运筹学与控制论] TP301.6[理学—数学]