{"references": ["A. A. Kuehn, and M. J. Hamburger, \"A heuristic program for locating\nwarehouses\" Management Science, vol. 9, pp. 643-666, 1963.", "M. L. Balinski, \"Integer programming: methods, uses, computation.\"\nManagement Science, vol. 12, pp. 253-313, 1965.", "S. L. Hakimi, \"Optimum locations of switching centers and the absolute\ncenters and medians of a graph\" Operations Research, vol. 12, pp. 450-\n459, 1964.", "S. L. Hakimi, \"Optimum distribution of switching centers in a\ncommunication network and some related graph theoretic problems\"\nOperations Research, vol. 13, pp. 462-475, 1965.", "G. Cornuejols, M. L. Fisher, and G. L. Nemhauser, \"Location of bank\naccounts to optimize float: an analytic study of exact and approximate\nalgorithms\" Management Science, vol. 23, pp. 789-810, 1977.", "R. D. Galv\u00e3o, and L. A. Raggi, \"A method for solving to optimality\nuncapacitated location problems\" Annals of Operations Research, vol.\n18, pp. 225-244, 1989.", "D. Erlenkotter, \"A dual-based procedure for uncapacitated facility\nlocation\", Operation Research, vol. 26, no.6, pp. 992\u20131009, 1978.", "M. Guignard, \"A Lagrangean dual ascent algorithm for plant location\nproblems\", European Journal of Operational Research, vol. 35, pp.\n193\u2013200, 1988.", "B. Goldengorin, D. Ghosh, and G. Sierksma, \"Branch and peg\nalgorithms for the simple plant location problem\", Computational\nOperations Research, vol. 31, pp. 241\u2013255, 2004.\n[10] M. Sun, \"Solving the uncapacitated facility location problem using tabu\nsearch\", Computers & Operations Research, vol. 33, pp. 2563\u20132589,\n2006.\n[11] P. Hansen, J. Brimberg, D. Uro\u0161evic\u00b4, and N. Mladenovic\u00b4, \"Primal-dual\nvariable neighborhood search for the simple plant-location problem\",\nINFORMS Journal on Computing, vol. 19, no. 4, pp. 552\u2013564, 2007.\n[12] A. M. Nezhad, H. Manzour, and S. Salhi, \"Lagrangian relaxation\nheuristics for the uncapacitated single-source multi-product facility\nlocation problem\", Int. J. Prod. Economics, vol. 145, pp. 713\u2013723, 2013.\n[13] J. Kratica, D. Dugo\u0161ija, and A. Savic\u00b4, \"A new mixed integer linear\nprogramming model for the multi level uncapacitated facility location\nproblem\", Applied Mathematical Modelling, vol. 38, pp. 2118\u20132129,\n2014.\n[14] E. Ardjmand, N. Park, G. Weckman, and M. R. Amin-Naseri, \"The\ndiscrete unconscious search and its application to uncapacitated facility\nlocation problem\", Computers & Industrial Engineering, vol. 73, pp.\n32\u201340, 2014.\n[15] A. N. Letchford, and S. J. Miller, \"An aggressive reduction scheme for\nthe simple plant location problem\", European Journal of Operational\nResearch, vol. 234, no. 3, pp. 674\u2013682, 2014.\n[16] E. Monabbati, and H. T. Kakhki, \"On a class of subadditive duals for the\nuncapacitated facility location problem\", Applied Mathematics and\nComputation, vol. 251, pp. 118\u2013131, 2015.\n[17] B. M. Khumawala, \"An efficient heuristic procedure for the capacitated\nwarehouse location problem\", Naval Research Logistics Quarterly, vol.\n21, pp. 609\u2013623, 1974.\n[18] A. M. Geoffrion, and R. McBride, \"Lagrangean relaxation to capacitated\nfacility location problems\", AIIE Transactions, 10, pp. 40\u201347, 1978.\n[19] Nauss, R.M., \"An improved algorithm for the capacitated facility\nlocation problem\", The Journal of the Operational Research Society,\nvol. 29, pp. 1195\u20131201, 1978.\n[20] N. Christofides, and J. E. Beasley, \"Extensions to a lagrangean\nrelaxation approach for the capacitated warehouse location problem\",\nEuropean Journal of Operational Research, vol. 12, pp. 19\u201328, 1983.\n[21] H. Pirkul, \"Efficient algorithms for the capacitated concentrator location\nproblem\", Computers & Operations Research, vol. 14, pp. 197\u2013208,\n1987.\n[22] B. Shetty, \"Approximate solutions to large scale capacitated facility\nlocation problems\", Applied Mathematics and Computation, vol. 39, pp.\n159\u2013175, 1990.\n[23] T. L. Magnanti, and R. T. Wong, \"Accelerating benders decomposition:\nAlgorithmic enhancement and model selection criteria\", Operations\nResearch, vol. 29, pp. 464\u2013484, 1981.\n[24] S. K. Jacobsen, \"Heuristics for the capacitated plant location model\"\nEuropean Journal of Operational Research, vol. 12, pp. 253\u2013261, 1983.\n[25] W. Domschke, and A. Drexl, \"ADD-heuristics' starting procedures for\ncapacitated plant location models\", European Journal of Operational\nResearch, vol. 21, pp. 47\u201353, 1985.\n[26] T. J. Van Roy, \"A cross decomposition algorithm for capacitated facility\nlocation\", Operations Research, vol. 34, pp. 145\u2013163, 1986.\n[27] J. M. Y. Leung, and T. L. Magnanti, \"Valid inequalities and facets of the\ncapacitated plant location problem\", Mathematical Programming, vol.\n44, pp. 271\u2013291, 1989.\n[28] G. R. Mateus, and C. T. Bornstein, \"Dominance criteria for the\ncapacitated warehouse location problem\", The Journal of the\nOperational Research Society, vol. 42, 145\u2013149, 1991.\n[29] K. Aardal, Y. Pochet, and L. A. Wolsey, \"Capacitated facility location:\nValid inequalities and facets\", Mathematics of Operations Research, vol.\n20, pp. 552\u2013582, 1995.\n[30] E. Rolland, D. A. Schilling, and J. R. Current, \"An efficient tabu search\nprocedure for the p-median problem\", European Journal of Operational\nResearch, 96, pp. 329\u2013342, 1996.\n[31] C. T. Bornstein, and H. B. Azlan, \"The use of reduction tests and\nsimulated annealing for the capacitated location problem\", Location\nScience, vol. 6, pp. 67\u201381, 1998.\n[32] G. Ghiani, F. Guerriero, and R. Musmanno, \"The capacitated plant\nlocation problem with multiple facilities in the same time\", Computers\nand Operations Research, vol. 50, pp. 268\u2013274, 1999.\n[33] L. A. N. Lorena, and E. L. F. Senne, \"A column generation approach to\ncapacitated p-median\", Computers & Operations Research, vol. 31, pp.\n863\u2013876, 2004.\n[34] S. H. Doong, C. C. Lai, and C. H. Wu, \"Genetic subgradient method for\nsolving location-allocation problems\", Applied Soft Computing, 7 (1),\npp. 373-386, 2007.\n[35] A. Klose, and S. G\u00f6rtz, \"A branch-and-price algorithm for the\ncapacitated facility location problem\", European Journal of Operational\nResearch, vol. 179, pp. 1109\u20131125, 2007.\n[36] M. A. Sambola, E. Fernandez, and F. S. Gama, \"The facility location\nproblem with Bernoulli demands\", Omega, vol. 39, pp. 335\u2013345, 2011.\n[37] T. K\u00fc\u00e7\u00fckdeniz, A. Baray, K. Ecerkale, and \u015e. Esnaf, \"Integrated use of\nfuzzy c-means and convex programming for capacitated multi-facility\nlocation problem\", Expert Systems with Applications, vol. 39, pp. 4306\u2013\n4314, 2012.\n[38] A. Rahmani, and M. A. MirHassani, \"A hybrid firefly-genetic algorithm\nfor the capacitated facility location problem\", Information Sciences, vol.\n283, 70\u201378, 2014.\n[39] I. Harris, C. L. Mumford, and M. M. Naim, \"A hybrid multi-objective\napproach to capacitated facility location with flexible store allocation for\ngreen logistics modeling\", Transportation Research, E 66, pp. 1\u201322,\n2014.\n[40] D. Ozgen, and B. Gulsun, \"Combining possibilistic linear programming\nand fuzzy AHP for solving the multi-objective capacitated multi-facility\nlocation problem\", Information Sciences, vol. 268, pp. 185\u2013201 2014.\n[41] J. Li, F. Chu, C. Prins, and Z. Zhu, \"Lower and upper bounds for a twostage\ncapacitated facility location problem with handling costs\",\nEuropean Journal of Operational Research, vol. 236, pp. 957\u2013967,\n2014.\n[42] K. Aardal, P. L. V. D. Berf, D. Gijswijt, and S. Li, \"Approximation\nalgorithms for hard capacitated k-facility location problems\", European\nJournal of Operational Research, vol. 242, pp. 358\u2013368, 2015.\n[43] R. V. Nagelhout, and G. L. Thompson, \"A single source transportation\nalgorithm\", Computers & Operations Research, vol. 7, no. 3, pp. 185-\n198, 1980.\n[44] A. W. Neebe, and M. R. Rao, \"An algorithm for the fixed-charge\nassigning users to sources problem\", The Journal of the Operational\nResearch Society, vol. 34, pp. 1107\u20131113, 1983.\n[45] J. G. Klincewicz, and H. Luss, \"A lagrangian relaxation heuristic for\ncapacitated facility location with single-source constraints\", Journal of\nthe Operational Research Society, vol. 37, no. 5, pp. 495\u2013500, 1986.\n[46] K. Darby-Dowman, and H. S. Lewis, \"Lagrangian relaxation and the\nsingle source capacitated facility location problem\", Journal of the\nOperational Research Society, vol. 39, pp. 1035\u20131040, 1988.\n[47] R. Sridharan, \"A Lagrangian heuristic for the capacitated plant location\nproblem with single source constraints\", European Journal of\nOperational Research, vol. 66, pp. 305\u2013312, 1993.\n[48] S. Tragantalerngsak, J. Holt, and M. R\u00f6nnqvist, \"Lagrangian heuristics\nfor the two-echelon, single-source, capacitated facility location\nproblem\", European Journal of Operational Research, vol. 102, pp.\n611\u2013625, 1997.\n[49] M. R\u00f6nnqvist, S. Tragantalerngsak, and J. Holt, \"A repeated matching\nheuristic for the single-source capacitated facility location problem\",\nEuropean Journal of Operational Research, vol. 116, pp. 51-68, 1999. [50] H. Delmaire, J. A. D\u0131\u00b4az, and E. Ferna\u00b4ndez, \"Reactive GRASP and tabu\nsearch based heuristics for the single source capacitated plant location\nproblem\" INFOR, Canadian Journal of Operational Research and\nInformation Processing, vol. 37, pp. 194\u2013225, 1999.\n[51] K. Holmberg, M. Ronnqvist, and D. Yuan, \"An exact algorithm for the\ncapacitated facility location problems with single sourcing\", European\nJournal of Operational Research, vol. 113, pp. 544-559, 1999.\n[52] H. Hindi, and K. Pienkosz, \"Efficient solution of large scale, singlesource,\ncapacitated plant location problem\", Journal of the Operational\nResearch Society, vol. 50, 268\u2013274, 1999.\n[53] S. Tragantalerngsak, J. Holt, and M. R\u00f6nnqvist, \"An exact method for\nthe two-echelon, single source, capacitated facility location problem\",\nEuropean Journal of Operational Research, vol. 123, no. 3, pp. 473\u2013\n489, 2000.\n[54] M. J. Cortinhal, and M. E. Captivo, \"Upper and lower bounds for the\nsingle source capacitated location problem\", European Journal of\nOperational Research, vol. 151, no. 2, pp. 333\u2013351, 2003.\n[55] R. K. Ahuja, J. B. Orlin, S. Pallottino, M. P. Scaparra, and M. G.\nScutell\u00e1, \"A multi-exchange heuristic for the single-source capacitated\nfacility location problem\", Management Science, vol. 50, no. 6, pp. 749-\n760, 2004.\n[56] C. H. Chen, and C. J. Ting, \"Applying multiple ant colony system to\nsolve the single source capacitated facility location problem\", Lecture\nNotes in Computer Science, vol. 4150, pp. 508\u2013509, 2006.\n[57] C. H. Chen, and C. J. Ting, \"Combining lagrangian heuristic and ant\ncolony system to solve the single source capacitated facility location\nproblem\", Transportation Research Part E, vol. 44, no. 1, pp. 1099\u2013\n1122, 2008.\n[58] I. Correia, and M. E. Captivo, \"Bounds for the single source modular\ncapacitated plant location problem\", Computers & Operations Research,\nvol. 33, pp. 2991\u20133003, 2006.\n[59] C. K. Y. Lin, \"Stochastic single-source capacitated facility location\nmodel with service level requirements\", International Journal of\nProduction Economics, 117, pp. 439\u2013451, 2009.\n[60] Z. Yang, F. Chu, and H. Chen, \"A cut-and-solve based algorithm for the\nsingle-source capacitated facility\", European Journal of Operational\nResearch, vol. 221, pp. 521\u2013532, 2012.\n[61] B. Addis, G. Carello, and A. Ceselli, \"Combining very large scale and\nILP based neighborhoods for a two-level location problem\", European\nJournal of Operational Research, vol. 231, pp. 535\u2013546, 2013.\n[62] G. Guastaroba, and M. G. Speranza, \"A heuristic for BILP problems:\nThe single source capacitated facility location problem\", European\nJournal of Operational Research, vol. 238, pp. 438\u2013450 2014.\n[63] S. Dantrakul, C. Likasiri, and R. Pongvuthithum, \"Applied p-median and\np-center algorithms for facility location problems\", Expert Systems with\nApplications, vol. 41, pp. 3596\u20133604, 2014.\n[64] M. Bieniek, \"A note on the facility location problem with stochastic\ndemands\", Omega, vol. 55, pp. 53\u201360, 2015."]}

Facility location is a complex real-world problem which needs a strategic management decision. This paper provides a general review on studies, efforts and developments in Facility Location Problems which are classical optimization problems having a wide-spread applications in various areas such as transportation, distribution, production, supply chain decisions and telecommunication. Our goal is not to review all variants of different studies in FLPs or to describe very detailed computational techniques and solution approaches, but rather to provide a broad overview of major location problems that have been studied, indicating how they are formulated and what are proposed by researchers to tackle the problem. A brief, elucidative table based on a grouping according to "General Problem Type" and "Methods Proposed" used in the studies is also presented at the end of the work.