[1]azirani V V. Approximation algorithms[M]. Berlin: Springer-Verlag, 2003. [2]杨丰梅,华国伟,邓猛,黎建强.选址问题研究的若干进展[J].运筹与管理,2005,14(6):1-7. [3]王非,徐渝,李毅学.离散设施选址问题研究综述[J].运筹与管理,2006,15(5):64-69. [4]刘勇,马良,宁爱兵.给定限期条件下应急选址问题的量子竞争决策算法[J].运筹与管理,2011,20(3):66-71. [5]徐大川,张家伟.设施选址问题的近似算法[M].北京:科学出版社,2013. [6]徐大川,杜东雷,吴晨晨.设施选址问题的近似算法综述[J].数学进展,2014,43(6):801-816. [7]Krarup J, Pruzan P M. The simple plant location problem: survey and synthesis[J]. European Journal of Operational Research, 1983, 12(1): 36-81. [8]Klose A. A branch and bound algorithm for an UFLP with a side constrain[J]. International Transactions in Operational Research, 1998, 5(2): 155-168. [9]安邦,程朋.基于分支割平面的一类无容量限制设施选址问题求解算法[J].运筹学学报,2015,19(4):1-13. [10]张惠珍,魏欣,马良.求解无容量设施选址问题的半拉格朗日松弛新方法[J].运筹学学报,2015,19(4):37-47. [11]Shmoys D B,Tardös É, Aardal K I. Approximation algorithms for facility location problems[A]. Proceedings of STOC[C]. New York: Association for Computing Machinery, 1997. 265-274. [12]Guha S, Khuller S. Greedy strikes back:improved facility location algorithms[J]. Journal of Algorithms, 1999, 31(1): 228-248. [13]Li S. A 1.488-approximation algorithm for the uncapacitated facility location problem[J]. Information and Computation, 2013, 222(1): 45-58. [14]Byrka J, Aardal K. An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem[J]. SIAM Journal on Computing, 2010, 39(6): 2212-2231. [15]Laurent M, Hentenryck P V. A simple tabu search for warehouse location[J]. European Journal of Operational Research, 2004, 157(3): 576-591. [16]郭崇慧,覃华勤.一种改进的禁忌搜索算法及其在选址问题中的应用[J].运筹与管理,2008,17(1):18-23. [17]Jaramillo J H, Bhadury J, Batta R. On the use of genetic algorithms to solve location problems[J]. Computers and Operations Research, 2002, 29(6): 761-779. [18]李岳佳.基于遗传算法的设施选址问题算法研究[D].山东科技大学,2012. [19]Sujay S, Arnab K, Kashinath D. A modified continuous particle swarm optimization algorithm for uncapacitated facility location problem[A]. Information Technology and Mobile Communication.Communications in Computer and Information Science[C]. Berlin Heidelberg:Springer, 2011. 305-311. [20]李倩,张惠珍,Cesar Beltran-Royo.求解无容量设施选址问题的混合蚁群算法[J].上海理工大学学报,2016,38(4):367-372. [21]李翼,赵茂先,李岳佳.无容量限制设施选址问题的分支定界法[J].山东理工大学学报,2012,26(1):70-73. |