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.
Al-Sultan K S, Al-Fawzan M A. A tabu search approach to the uncapacitated facility location problem [J].Annals of Operations Research, 1999, 86: 91-103.
Laurent M, Hentenryck P V. A simple tabu search for warehouse location [J]. European Journal of Operational Research, 2004,157(3): 576-591.
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.
Ghosh D. Neighborhood search heuristics for the uncapacitated facility location problem [J]. European Journal of Operational Research, 2003, 150(1): 150-162.
王大志, 闫杨, 汪定伟, 等. 基于OpenMP求解无容量设施选址问题的并行PSO算法 [J]. 东北大学学报(自然科学版), 2008, 29(12): 1681-1684.
Sujay Saha, Arnab Kole, Kashinath Dey. 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.
Shi Li. A 1.488 approximation algorithm for the uncapacitated facility location problem [J]. Information and Computation,2013, 222(1): 45-58.
Beltran-Royo C, Tadonki C, Vial J.-Ph. Solving the p-median problem with a semi-Lagrangian relaxation [J]. Computational Optimization and Applications, 2006,35(2): 239-260.
Beltran-Royo C, Vial J.-P, Alonso-Ayuso A. Semi-Lagrangian relaxation applied to the uncapacitated facility location problem [J]. Computational Optimization and Applications, 2012,51(1): 387-409.
M. Hoefer. Ufllib, 2006. http://www.mpi-inf.mpg.de/departments/d1/projects/benchmarks/ UflLib/index.html.