{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:30:34Z","timestamp":1760596234168},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,4,23]],"date-time":"2014-04-23T00:00:00Z","timestamp":1398211200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10898-014-0183-1","type":"journal-article","created":{"date-parts":[[2014,4,22]],"date-time":"2014-04-22T05:00:11Z","timestamp":1398142811000},"page":"501-514","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Solving the planar p-median problem by variable neighborhood and concentric searches"],"prefix":"10.1007","volume":"63","author":[{"given":"Zvi","family":"Drezner","sequence":"first","affiliation":[]},{"given":"Jack","family":"Brimberg","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]},{"given":"Said","family":"Salhi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,23]]},"reference":[{"key":"183_CR1","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01581151","volume":"66","author":"I Bongartz","year":"1994","unstructured":"Bongartz, I., Calamai, P.H., Conn, A.R.: A projection method for $$\\ell _p$$ \u2113 p norm location-allocation problems. Math. Program. 66, 238\u2013312 (1994)","journal-title":"Math. Program."},{"key":"183_CR2","first-page":"1","volume":"10","author":"J Brimberg","year":"1996","unstructured":"Brimberg, J., Mladenovi\u0107, N.: A variable neighbourhood algorithm for solving the continuous location-allocation problem. Stud. Locat. Anal. 10, 1\u201312 (1996)","journal-title":"Stud. Locat. Anal."},{"key":"183_CR3","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","volume":"48","author":"J Brimberg","year":"2000","unstructured":"Brimberg, J., Hansen, P., Mladenovi\u0107, N., Taillard, E.: Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem. Oper. Res. 48, 444\u2013460 (2000)","journal-title":"Oper. Res."},{"key":"183_CR4","first-page":"1","volume":"5","author":"J Brimberg","year":"2008","unstructured":"Brimberg, J., Hansen, P., Mladenovi\u0107, N., Salhi, S.: A survey of solution methods for the continuous location-allocation problem. Int. J. Oper. Res. 5, 1\u201312 (2008)","journal-title":"Int. J. Oper. Res."},{"key":"183_CR5","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.cor.2012.07.012","volume":"40","author":"J Brimberg","year":"2013","unstructured":"Brimberg, J., Drezner, Z.: A new heuristic for solving the p-median problem in the plane. Comput. Oper. Res. 40, 427\u2013437 (2013)","journal-title":"Comput. Oper. Res."},{"key":"183_CR6","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.ejor.2013.06.022","volume":"232","author":"J Brimberg","year":"2014","unstructured":"Brimberg, J., Drezner, Z., Mladenovi\u0107, N., Salhi, S.: A new local search for continuous location problems. Eur. J. Oper. Res. 232, 256\u2013265 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"183_CR7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01934511","volume":"24","author":"S Carlsson","year":"1984","unstructured":"Carlsson, S.: Improving worst-case behavior of heaps. BIT Numer. Math. 24, 14\u201318 (1984)","journal-title":"BIT Numer. Math."},{"key":"183_CR8","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1002\/nav.3800300309","volume":"30","author":"R Chen","year":"1983","unstructured":"Chen, R.: Solution of minisum and minimax location-allocation problems with euclidean distances. Nav. Res. Logist. Q. 30, 449\u2013459 (1983)","journal-title":"Nav. Res. Logist. Q."},{"key":"183_CR9","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1287\/opre.46.4.548","volume":"46","author":"PC Chen","year":"1998","unstructured":"Chen, P.C., Hansen, P., Jaumard, B., Tuy, H.: A fast algorithm for the greedy interchange for large-scale clustering and median location problems by D.-C. programming. Oper. Res. 46, 548\u2013562 (1998)","journal-title":"Oper. Res."},{"key":"183_CR10","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/opre.11.3.331","volume":"11","author":"L Cooper","year":"1963","unstructured":"Cooper, L.: Location-allocation problems. Oper. Res. 11, 331\u2013343 (1963)","journal-title":"Oper. Res."},{"key":"183_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1006005","volume":"6","author":"L Cooper","year":"1964","unstructured":"Cooper, L.: Heuristic methods for location-allocation problems. SIAM Rev. 6, 37\u201353 (1964)","journal-title":"SIAM Rev."},{"key":"183_CR12","unstructured":"Drezner, Z., Brimberg, J., Salhi, S., Mladenovi\u0107, N.: Effective heuristics for solving the multi-source Weber problem. in review (2013)"},{"key":"183_CR13","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.18.4.351","volume":"18","author":"Z Drezner","year":"1984","unstructured":"Drezner, Z.: The planar two-center and two-median problems. Transp. Sci. 18, 351\u2013361 (1984)","journal-title":"Transp. Sci."},{"key":"183_CR14","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0966-8349(96)00004-6","volume":"3","author":"Z Drezner","year":"1996","unstructured":"Drezner, Z.: A note on accelerating the Weiszfeld procedure. Locat. Sci. 3, 275\u2013279 (1996)","journal-title":"Locat. Sci."},{"key":"183_CR15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1155\/S1173912602000093","volume":"6","author":"Z Drezner","year":"2002","unstructured":"Drezner, Z.: A new heuristic for the quadratic assignment problem. J. Appl. Math. Decis. Sci. 6, 163\u2013173 (2002)","journal-title":"J. Appl. Math. Decis. Sci."},{"key":"183_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-56082-8_1","volume-title":"Facility Location: Applications and Theory","author":"Z Drezner","year":"2002","unstructured":"Drezner, Z., Klamroth, K., Sch\u00f6bel, A., Wesolowsky, G.O.: The Weber problem. In: Drezner, Z., Hamacher, H.W. (eds.) Facility Location: Applications and Theory, pp. 1\u201336. Springer, Berlin (2002)"},{"key":"183_CR17","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1287\/ijoc.15.3.320.16076","volume":"15","author":"Z Drezner","year":"2003","unstructured":"Drezner, Z.: A new genetic algorithm for the quadratic assignment problem. INFORMS J. Comput. 15, 320\u2013330 (2003)","journal-title":"INFORMS J. Comput."},{"key":"183_CR18","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/S0377-2217(03)00438-7","volume":"160","author":"Z Drezner","year":"2005","unstructured":"Drezner, Z.: The extended concentric tabu for the quadratic assignment problem. Eur. J. Oper. Res. 160, 416\u2013422 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"183_CR19","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"139","author":"Z Drezner","year":"2005","unstructured":"Drezner, Z., Hahn, P.M., Taillard, E.D.: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann. Oper. Res. 139, 65\u201394 (2005)","journal-title":"Ann. Oper. Res."},{"key":"183_CR20","volume-title":"Distribution Management","author":"S Eilon","year":"1971","unstructured":"Eilon, S., Watson-Gandy, C.D.T., Christofides, N.: Distribution Management. Hafner, New York (1971)"},{"key":"183_CR21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"HN Gabow","year":"1986","unstructured":"Gabow, H.N., Galil, Z., Spencer, T., Tarjan, R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6, 109\u2013122 (1986)","journal-title":"Combinatorica"},{"key":"183_CR22","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$$ p -median. Locat. Sci. 5, 207\u2013226 (1997)","journal-title":"Locat. Sci."},{"key":"183_CR23","unstructured":"Krau, S.: Extensions du probl\u00e8me de Weber. PhD thesis, \u00c9cole Polytechnique de Montr\u00e9al (1997)"},{"issue":"3","key":"183_CR24","first-page":"219","volume":"9","author":"DT Lee","year":"1980","unstructured":"Lee, D.T., Schachter, B.J.: Two algorithms for constructing a Delaunay triangulation. Int. J. Parallel Program. 9(3), 219\u2013242 (1980)","journal-title":"Int. J. Parallel Program."},{"key":"183_CR25","first-page":"443","volume":"33","author":"RF Love","year":"1982","unstructured":"Love, R.F., Juel, H.: Properties and solution methods for large location-allocation problems. J. Oper. Res. Soc. 33, 443\u2013452 (1982)","journal-title":"J. Oper. Res. Soc."},{"key":"183_CR26","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput. 13, 182\u2013196 (1984)","journal-title":"SIAM J. Comput."},{"key":"183_CR27","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":"183_CR28","first-page":"629","volume":"33","author":"BA Murtagh","year":"1982","unstructured":"Murtagh, B.A., Niwattisyawong, S.R.: An efficient method for the multi-depot location-allocation problem. J. Oper. Res. Soc. 33, 629\u2013634 (1982)","journal-title":"J. Oper. Res. Soc."},{"key":"183_CR29","doi-asserted-by":"crossref","first-page":"306","DOI":"10.15807\/jorsj.27.306","volume":"27","author":"T Ohya","year":"1984","unstructured":"Ohya, T., Iri, M., Murota, K.: Improvements of the incremental method of the Voronoi diagram with computational comparison of various algorithms. J. Oper. Res. Soc. Jpn. 27, 306\u2013337 (1984)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"183_CR30","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSLIB a traveling salesman library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"183_CR31","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cor.2009.03.031","volume":"37","author":"A Sch\u00f6bel","year":"2010","unstructured":"Sch\u00f6bel, A., Scholz, D.: The big cube small cube solution method for multidimensional facility location problems. Comput. Oper. Res. 37, 115\u2013122 (2010)","journal-title":"Comput. Oper. Res."},{"key":"183_CR32","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1142\/S0218195994000124","volume":"4","author":"K Sugihara","year":"1994","unstructured":"Sugihara, K., Iri, M.: A robust topology-oriented incremental algorithm for Voronoi diagram. Int. J. Comput. Geom. Appl. 4, 179\u2013228 (1994)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"183_CR33","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1021841728075","volume":"9","author":"\u00c9 Taillard","year":"2003","unstructured":"Taillard, \u00c9.: Heuristic methods for large centroid clustering problems. J. Heuristics 9, 51\u201373 (2003)","journal-title":"J. Heuristics"},{"key":"183_CR34","unstructured":"Weber, A.: \u00dcBer Den Standort Der Industrien, 1. Teil: Reine Theorie Des Standortes. English Translation: on the Location of Industries. University of Chicago Press, Chicago, IL. Originally published in T\u00fcbingen, Germany in 1909 (1929)"},{"key":"183_CR35","first-page":"355","volume":"43","author":"E Weiszfeld","year":"1936","unstructured":"Weiszfeld, E.: Sur le point pour lequel la somme des distances de n points donnes est minimum. Tohoku Math. J. 43, 355\u2013386 (1936)","journal-title":"Tohoku Math. J."},{"key":"183_CR36","first-page":"5","volume":"1","author":"GO Wesolowsky","year":"1993","unstructured":"Wesolowsky, G.O.: The Weber problem: history and perspectives. Locat. Sci. 1, 5\u201323 (1993)","journal-title":"Locat. Sci."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0183-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0183-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0183-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T15:46:26Z","timestamp":1565365586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0183-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,23]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["183"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0183-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,23]]}}}