References

[1] Alves, M.L., & Almeida, M.T. (1992). Simulated annealing algorithm for simple plant location problem. Rev. Invest., 12.

[2] Balinski, M. (1965). Integer programming: Methods, uses computation. Management Science, 12, 254-313.

[3] Beasley, J.E. (1990). OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society, 41, 1069-1072.

[4] Bilde, O., & Krarup, J. (1997). Sharp lower bounds and efficient algorithms for the simple plant location problem. Annals of Discrete Mathematics, 1, pp 77-97. 

[5] Brandeau M.L., & Chiu, S.S. (1989). An overview of representative problems in location research. Management Science, 35, 6, 645-674.

[6] Conn, A.R., & Cornuéjols, G. (1990). A Projection method for the uncapacitated facility location problem. Mathematical Programming, 46, pp. 273-298.

[7] Cornuejols, G., Nemhauser, G.L. & Wolsey, L.A. (1990) The uncapacitated facility location problem. In: Mirchandani, P.B., & Francis, R.L. (Eds.), Discrete Location Theory, Wiley-InterScience, New York, pp. 119-171.

[8] Crainic, T.G. (2003). Long-Haul Freight Transportation. Handbook of Transportation Science, Springer New York, NY.

[9] Erlenkotter, D. (1978). A Dual-Based Procedure for Uncapacitated Facility Location. Operations Research, 26(6), 992-1009.

[10] Galvăo, R.D. (2004). Uncapacitated Facility Location Problems: Contributions. Pesquisa Operacional, 24, 7 -38.

[11] Ghosh, D. (2003). Neighborhood search heuristics for the uncapacitated facility location problem. European Journal of Operational Research, 150, 150-162.

[12] Goldengorin, B., Tijssen, G.A., Ghosh, D., & Sierksma G. (2003). Solving the Simple Plant Location Problem using a Data Correcting Approach. Journal of Global Optimization, 25(4), 377-406.

[13] Goldengorin, B. Ghosh, D. & Sierksma, G. (2004). Branch and peg algorithms for the simple plant location problem. Computers & OR 31(2) pp. 241-255.

[14] Hale, T.S., & Moberg, C.R. (2003). Location Science Research: A Review. Annals of Operations Research, 123, 21-35.

[15] Janáček, J., & Kovačiková, J. (1997). Exact Solution Techniques for Large Location Problems. In Proceedings of the International Conference: Mathematical Methods in Economics, Ostrava, 80-84.

[16] Janáček, J. (2004). Service System Design in the Public and Private Sectors. In Proceedings of the International Conference: Mathematical Methods in Economics,  Virt, 101 – 108.

[17] Klose, A., & Drexl, A. (2005). Facility location models for distribution system design. European Journal of Operational Research 162, 4-29.

[18] Körkel, M. (1989). On then exact solution of large – scale simple plant location problem. European Journal of Operational Research, 39(2), 157-173.

[19] Kratica, J., Tosic, D.,  Filipovic, V., & Ljubic, I. (2001). Solving the simple plant location problem by genetic algorithm RAIRO Operations Research, 35, 127-142.

[20] Labbé, M., &Louveaux, F.V., (1997). Location problem. In: DellAmico N, Maffioli F and Martello S (Eds). Annotated Bibliographies in Combinatorial Optimization. John Wiley & Sons: New York, pp. 264–271.

[21] Michel, L., & Hentenrych, P.V. (2004). A simple tabu search for warehouse location. European Journal of Operational Research, 157(3), 576 ‑ 591.

[22] Mladenović, N., Brimberg, J., & Hansen, P. (2006). A note on duality gap in the simple plant location problem. European Journal of Operational Research, 174, 11-22.

[23] Owen, H.O., & Daskin, M.S. (1998). Strategic facility location: A review. European journal of Operational Research 111, 423-447.

[24] Resende, M.G.C, & Werneck, R.F. (2006). A hybrid multistart heuristic for the uncapacitated facility location problem. European Journal of Operational Research, 174, 54-68.

[25] Sultan, K.S., & Fawzan, M.A. (1999). A tabu search approach to the uncapacitated facility location problem. Annals of Operations Research, 86, 91 – 103.