摘要
研究了单阶段度量设施选址问题的推广问题平方度量动态设施选址问题.研究中首先利用原始对偶技巧得到9-近似算法,然后利用贪婪增广技巧将近似比改进到2.606,最后讨论了该问题的相应变形问题.
We consider a generalization of the classic single-period metric facility location problem,which is the squared metric dynamic facility location problem.We utilize the primal-dual scheme to design a 9-approximation algorithm.Then the approximation ratio is improved to 2:606 by the greedy improvement technique.We also give some discussion for several variants of the squared metric dynamic facility location problem in future work.
作者
姜燕君
徐大川
张冬梅
JIANG Yanjun;XU Dachuan;ZHANG Dongmei(College of Applied Sciences,Beijing University of Technology,Beijing 100124,China;School of Computer Science and Technology,Shandong Jianzhu University,Jinan 250101,China)
出处
《运筹学学报》
CSCD
北大核心
2018年第3期49-58,共10页
Operations Research Transactions
基金
国家自然科学基金(Nos.11871081
11801251)
山东省绿色建筑协同创新中心团队建设基金(No.20013)
关键词
设施选址问题
近似算法
NP-难
facility location problem
approximation algorithm
NP-hard