{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T10:55:37Z","timestamp":1691492137744},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T00:00:00Z","timestamp":1187740800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s11222-007-9036-9","type":"journal-article","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T15:07:08Z","timestamp":1187708828000},"page":"41-46","source":"Crossref","is-referenced-by-count":5,"title":["Complement to a comparative analysis of heuristics for\u00a0the\u00a0p-median problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,8,22]]},"reference":[{"key":"9036_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s11222-006-8079-7","volume":"16","author":"E. Alba","year":"2006","unstructured":"Alba, E., Dom\u00ednguez, E.: Comparative analysis of modern optimization tools for the p-median problem. Stat. Comput. 16, 251\u2013260 (2006)","journal-title":"Stat. Comput."},{"key":"9036_CR2","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","volume":"21","author":"J.E. Beasley","year":"1985","unstructured":"Beasley, J.E.: A note on solving large p-median problems. Eur. J. Oper. Res. 21, 270\u2013273 (1985)","journal-title":"Eur. J. Oper. Res."},{"key":"9036_CR3","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/mnsc.35.6.645","volume":"35","author":"M.L. Brandeau","year":"1989","unstructured":"Brandeau, M.L., Chiu, S.S.: An overview of representative problems in location research. Manag. Sci. 35, 645\u2013674 (1989)","journal-title":"Manag. Sci."},{"key":"9036_CR4","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/0-306-48056-5_17","volume-title":"Handbook of Metaheuristics","author":"T. Crainic","year":"2003","unstructured":"Crainic, T., Toulouse, M.: Parallel strategies for metaheuristics. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 475\u2013513. Kluwer Academic, Dordrecht (2003)"},{"key":"9036_CR5","first-page":"289","volume":"10","author":"T. Crainic","year":"2004","unstructured":"Crainic, T., Gendreau, M., Hansen, P., Mladenovi\u0107, N.: Cooperative parallel variable neighborhood search for the p-median. J. Heuristics 10, 289\u2013310 (2004)","journal-title":"J. Heuristics"},{"key":"9036_CR6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O. du Merle","year":"1999","unstructured":"du Merle, O., Villeneuve, D., Desrosiers, J., Hansen, P.: Stabilized column generation. Discret. Math. 194, 229\u2013237 (1999)","journal-title":"Discret. Math."},{"key":"9036_CR7","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1023\/A:1015013919497","volume":"8","author":"F. Garc\u00eda-L\u00f3pez","year":"2002","unstructured":"Garc\u00eda-L\u00f3pez, F., Meli\u00e1n Batista, B., Moreno P\u00e9rez, J.A., Moreno Vega, J.M.: The parallel variable neighborhood search for the p-median problem. J. Heuristics 8, 375\u2013388 (2002)","journal-title":"J. Heuristics"},{"key":"9036_CR8","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/S0167-8191(03)00043-7","volume":"29","author":"F. Garc\u00eda-L\u00f3pez","year":"2003","unstructured":"Garc\u00eda-L\u00f3pez, F., Meli\u00e1n Batista, B., Moreno P\u00e9rez, J.A., Moreno Vega, J.M.: Parallelization of the scatter search for the p-median problem. Parallel Comput. 29, 575\u2013589 (2003)","journal-title":"Parallel Comput."},{"key":"9036_CR9","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"S.L. Hakimi","year":"1965","unstructured":"Hakimi, S.L.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 13, 462\u2013472 (1965)","journal-title":"Oper. Res."},{"key":"9036_CR10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search for the p-Median. Locat. Sci. 5, 207\u2013226 (1997)","journal-title":"Locat. Sci."},{"key":"9036_CR11","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9036_CR12","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N., Perez-Brito, D.: Variable neighborhood decomposition search. J. Heuristics 7, 335\u2013350 (2001)","journal-title":"J. Heuristics"},{"key":"9036_CR13","doi-asserted-by":"crossref","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. (2007, in press). doi: 10.1287\/ijoc.1060.0196","DOI":"10.1287\/ijoc.1060.0196"},{"key":"9036_CR14","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part 2. The p-medians. SIAM J. Appl. Math. 37, 539\u2013560 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"9036_CR15","first-page":"261","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"M. Labb\u00e9","year":"1997","unstructured":"Labb\u00e9, M., Louveaux, F.V.: Location problems. In: Dell\u2019Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 261\u2013281. Wiley, New York (1997)"},{"key":"9036_CR16","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9036_CR17","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N. Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107, N., Brimberg, J., Hansen, P., Moreno-Perez, J.: The p-median problem: A survey of metaheuristic approaches. Eur. J. Oper. Res. 179, 927\u2013939 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9036_CR18","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/0471739383.ch11","volume-title":"Parallel Metaheuristics: A New Class of Algorithms","author":"J.A. Moreno-Perez","year":"2005","unstructured":"Moreno-Perez, J.A., Hansen, P., Mladenovi\u0107, N.: Parallel variable neighborhood search. In: Alba, E. (ed.) Parallel Metaheuristics: A New Class of Algorithms, pp. 247\u2013266. Wiley, New York (2005)"},{"key":"9036_CR19","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/0-306-48056-5_5","volume-title":"Handbook of Metaheuristics","author":"P. Moscato","year":"2003","unstructured":"Moscato, P., Cotta, C.: A gentle introduction to Memetic Algorithms. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 105\u2013144. Kluwer Academic, Boston\/Dordrecht\/London (2003)"},{"key":"9036_CR20","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: tsplib\u2014A traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"9036_CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"M.G. Resende","year":"2004","unstructured":"Resende, M.G., Werneck, R.F.: A hybrid heuristic for the p-median problem. J. Heuristics 10, 59\u201388 (2004)","journal-title":"J. Heuristics"},{"key":"9036_CR22","first-page":"95","volume":"21","author":"R. Whitaker","year":"1983","unstructured":"Whitaker, R.: A fast algorithm for the greedy-interchange for large-scale clustering and median location problems. INFOR 21, 95\u2013108 (1983)","journal-title":"INFOR"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-007-9036-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-007-9036-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-007-9036-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:10:49Z","timestamp":1559369449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-007-9036-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,22]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9036"],"URL":"https:\/\/doi.org\/10.1007\/s11222-007-9036-9","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,22]]}}}