{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:14Z","timestamp":1759063694357},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,2,9]],"date-time":"2014-02-09T00:00:00Z","timestamp":1391904000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s12532-014-0065-z","type":"journal-article","created":{"date-parts":[[2014,2,8]],"date-time":"2014-02-08T19:26:03Z","timestamp":1391887563000},"page":"199-231","source":"Crossref","is-referenced-by-count":22,"title":["An exact cooperative method for the uncapacitated facility location problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Marius","family":"Posta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques A.","family":"Ferland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Michelon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,9]]},"reference":[{"issue":"3","key":"65_CR1","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F Barahona","year":"2000","unstructured":"Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87(3), 385\u2013399 (2000)","journal-title":"Math. Program."},{"key":"65_CR2","unstructured":"Beasley, J. E.: Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65(3), 383\u2013399 (1993)"},{"key":"65_CR3","unstructured":"Beltran, C., Tadonki, C., Vial, J. P.: Solving the p-median problem with a semi-lagrangian relaxation. Comput. Optim. Appl. 35(2), 239\u2013260 (2006)"},{"key":"65_CR4","unstructured":"Beltran-Royo, C., Vial, J.P., Alonso-Ayuso, A.: Semi-lagrangian relaxation applied to the uncapacitated facility location problem. Comput. Optim. Appl. 51(1), 387\u2013409 (2012)"},{"key":"65_CR5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0167-5060(08)70728-3","volume":"1","author":"O Bilde","year":"1977","unstructured":"Bilde, O., Krarup, J.: Sharp lower bounds and efficient algorithms for the simple plant location problem. Ann. Discret. Math. 1, 79\u201397 (1977)","journal-title":"Ann. Discret. Math."},{"key":"65_CR6","doi-asserted-by":"crossref","unstructured":"Bloom, B. H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","DOI":"10.1145\/362686.362692"},{"issue":"6","key":"65_CR7","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1137\/070708901","volume":"39","author":"J Byrka","year":"2010","unstructured":"Byrka, J., Aardal, K.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J. Comput. 39(6), 2212\u20132231 (2010)","journal-title":"SIAM J. Comput."},{"key":"65_CR8","doi-asserted-by":"crossref","unstructured":"Conn, A. R., Cornuejols, G.: A projection method for the uncapacitated facility location problem. Math. Program. 46(1), 273\u2013298 (1990)","DOI":"10.1007\/BF01585746"},{"key":"65_CR9","unstructured":"Cornuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P.B., Francis, R.L. (eds.) Discrete Location Theory, pp. 1\u201354. Wiley, New York (1983)"},{"issue":"4","key":"65_CR10","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1016\/j.cie.2010.09.012","volume":"59","author":"T Cura","year":"2010","unstructured":"Cura, T.: A parallel local search approach to solving the uncapacitated warehouse location problem. Comput. Ind. Eng. 59(4), 1000\u20131009 (2010)","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"65_CR11","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D Erlenkotter","year":"1978","unstructured":"Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Oper. Res. 26(6), 992\u20131009 (1978)","journal-title":"Oper. Res."},{"key":"65_CR12","unstructured":"Flaxman, A. D., Frieze, A. M., Vera, J. C.: On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. Comb. Probab. Comput. 16(05), 713\u2013732 (2007)"},{"key":"65_CR13","unstructured":"Galv\u00e3o, R. D., Raggi, L. A.: A method for solving to optimality uncapacitated location problems. Ann. Oper. Res. 18(1), 225\u2013244 (1989)"},{"issue":"1","key":"65_CR14","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/S0377-2217(02)00504-0","volume":"150","author":"D Ghosh","year":"2003","unstructured":"Ghosh, D.: Neighborhood search heuristics for the uncapacitated facility location problem. Eur. J. Oper. Res. 150(1), 150\u2013162 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"65_CR15","doi-asserted-by":"crossref","unstructured":"Glover, F.: A template for scatter search and path relinking. In: Artificial evolution, pp. 1\u201351. Springer, Berlin (1998)","DOI":"10.1007\/BFb0026589"},{"key":"65_CR16","unstructured":"Goldengorin, B., Ghosh, D., Sierksma, G.: Branch and peg algorithms for the simple plant location problem. In: Computers and operations research. Comput. Oper. Res. 30(1), 967\u2013981 (2003)"},{"key":"65_CR17","doi-asserted-by":"crossref","unstructured":"Goldengorin, B., Tijssen, G. A., Ghosh, D., Sierksma, G.: Solving the simple plant location problem using a data correcting approach. J. Global Optim. 25(4), 377\u2013406 (2003)","DOI":"10.1023\/A:1022503826877"},{"key":"65_CR18","unstructured":"Guner, A. R., Sevkli, M.: A discrete particle swarm optimization algorithm for uncapacitated facility location problem. J. Artif. Evol. Appl. 2008, 1\u20139 (2008)"},{"issue":"4","key":"65_CR19","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1287\/ijoc.1060.0196","volume":"19","author":"P Hansen","year":"2007","unstructured":"Hansen, P., Brimberg, J., Uro\u0161evi\u0107, D., Mladenovi\u0107, N.: Primal-dual variable neighborhood search for the simple plant-location problem. INFORMS J. Comput. 19(4), 552 (2007)","journal-title":"INFORMS J. Comput."},{"key":"65_CR20","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex analysis and minimization algorithms: Fundamentals, vol. 305. Springer, Berlin (1996)"},{"key":"65_CR21","doi-asserted-by":"crossref","unstructured":"Homberger, J., Gehring, H.: A two-level parallel genetic algorithm for the uncapacitated warehouse location problem. In: Hawaii international conference on system sciences, proceedings of the 41st Annual, p. 67. IEEE (2008)","DOI":"10.1109\/HICSS.2008.42"},{"key":"65_CR22","doi-asserted-by":"crossref","unstructured":"Julstrom, B.: A permutation coding with heuristics for the uncapacitated facility location problem. Recent advances in evolutionary computation for combinatorial optimization. pp. 295\u2013307 (2008)","DOI":"10.1007\/978-3-540-70807-0_18"},{"issue":"2","key":"65_CR23","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0377-2217(89)90189-6","volume":"39","author":"M K\u00f6rkel","year":"1989","unstructured":"K\u00f6rkel, M.: On the exact solution of large-scale simple plant location problems. Eur. J. Oper. Res. 39(2), 157\u2013173 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"65_CR24","unstructured":"Krarup, J., Pruzan, P. M.: The simple plant location problem: survey and synthesis. Eur. J. Oper. Res. 12(1), 36\u201381 (1983)"},{"issue":"1","key":"65_CR25","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1051\/ro:2001107","volume":"35","author":"J Kratica","year":"2001","unstructured":"Kratica, J., To\u0161ic, D., Filipovi\u0107, V., Ljubi\u0107, I.: Solving the simple plant location problem by genetic algorithm. Oper. Res. 35(1), 127\u2013142 (2001)","journal-title":"Oper. Res."},{"key":"65_CR26","unstructured":"Labbe, M., Louveaux, F.: Location problems. In: Dell\u2019Amico, M., Maffioli, F., Martello, S. (eds.) Annotated bibliographies in combinatorial optimization, pp. 261\u2013281. Wiley, New York (1997)"},{"key":"65_CR27","unstructured":"Letchford, A. N., Miller, S. J.: An aggressive reduction scheme for the simple plant location problem. Tech. rep., Department of Management Science, Lancaster University (2011)"},{"key":"65_CR28","unstructured":"Letchford, A. N., Miller, S. J.: Fast bounding procedures for large instances of the simple plant location problem. Comput. Oper. Res. 39(5), 985\u2013990 (2012)"},{"key":"65_CR29","doi-asserted-by":"crossref","unstructured":"Li, S.: A 1.488 approximation algorithm for the uncapacitated facility location problem. Automata, languages and programming, pp. 77\u201388 (2011)","DOI":"10.1007\/978-3-642-22012-8_5"},{"issue":"2","key":"65_CR30","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/S0097539703435716","volume":"36","author":"M Mahdian","year":"2006","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Approximation algorithms for metric facility location problems. SIAM J. Comput. 36(2), 411\u2013432 (2006)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"65_CR31","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/S0377-2217(03)00247-9","volume":"157","author":"L Michel","year":"2004","unstructured":"Michel, L., Van Hentenryck, P.: A simple tabu search for warehouse location. Eur. J. Oper. Res. 157(3), 576\u2013591 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"65_CR32","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.ejor.2004.12.022","volume":"174","author":"N Mladenovi\u0107","year":"2006","unstructured":"Mladenovi\u0107, N., Brimberg, J., Hansen, P.: A note on duality gap in the simple plant location problem. Eur. J. Oper. Res. 174(1), 11\u201322 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"65_CR33","unstructured":"Muter, \u0130., Birbil, S. I., Sahin, G.: Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems. INFORMS J. Comput. 22(4), 603\u2013619 (2010)"},{"issue":"1","key":"65_CR34","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"65_CR35","unstructured":"Resende, M. G.C., Werneck, R. F.: A hybrid multistart heuristic for the uncapacitated facility location problem. Eur. J. Oper. Res. 174(1), 54\u201368 (2006)"},{"issue":"9","key":"65_CR36","doi-asserted-by":"crossref","first-page":"2563","DOI":"10.1016\/j.cor.2005.07.014","volume":"33","author":"M Sun","year":"2006","unstructured":"Sun, M.: Solving the uncapacitated facility location problem using tabu search. Comput. Oper. Res. 33(9), 2563\u20132589 (2006)","journal-title":"Comput. Oper. Res."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0065-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-014-0065-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0065-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:23:04Z","timestamp":1565184184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-014-0065-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,9]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["65"],"URL":"https:\/\/doi.org\/10.1007\/s12532-014-0065-z","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,9]]}}}