{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T13:24:27Z","timestamp":1768742667345,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T00:00:00Z","timestamp":1439337600000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10479-015-1961-y","type":"journal-article","created":{"date-parts":[[2015,8,11]],"date-time":"2015-08-11T07:03:28Z","timestamp":1439276608000},"page":"639-654","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Incorporating neighborhood reduction for the solution of the planar p-median problem"],"prefix":"10.1007","volume":"258","author":[{"given":"Zvi","family":"Drezner","sequence":"first","affiliation":[]},{"given":"Said","family":"Salhi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,12]]},"reference":[{"key":"1961_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.20408","volume":"58","author":"O Berman","year":"2011","unstructured":"Berman, O., Drezner, Z., & Krass, D. (2011). Big segment small segment global optimization algorithm on networks. Networks, 58, 1\u201311.","journal-title":"Networks"},{"key":"1961_CR2","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. (1994). A projection method for \n                        $$\\ell _p$$\n                        \n                            \n                                            \n                                \n                                    \u2113\n                                    p\n                                \n                            \n                        \n                     norm location-allocation problems. Mathematical Programming, 66, 238\u2013312.","journal-title":"Mathematical Programming"},{"key":"1961_CR3","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. (2013). A new heuristic for solving the p-median problem in the plane. Computers & Operations Research, 40, 427\u2013437.","journal-title":"Computers & Operations Research"},{"key":"1961_CR4","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. (2014). A new local search for continuous location problems. European Journal of Operational Research, 232, 256\u2013265.","journal-title":"European Journal of Operational Research"},{"key":"1961_CR5","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/imaman\/dpl002","volume":"17","author":"J Brimberg","year":"2006","unstructured":"Brimberg, J., Hansen, P., & Mladenovi\u0107, N. (2006). Decomposition strategies for large-scale continuous location-allocation problems. IMA Journal of Management Mathematics, 17, 307\u2013316.","journal-title":"IMA Journal of Management Mathematics"},{"key":"1961_CR6","first-page":"1","volume":"5","author":"J Brimberg","year":"2008","unstructured":"Brimberg, J., Hansen, P., Mladenovi\u0107, N., & Salhi, S. (2008). A survey of solution methods for the continuous location-allocation problem. International Journal of Operations Research, 5, 1\u201312.","journal-title":"International Journal of Operations Research"},{"key":"1961_CR7","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. (2000). Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem. Operations Research, 48, 444\u2013460.","journal-title":"Operations Research"},{"key":"1961_CR8","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. (1998). A fast algorithm for the greedy interchange for large-scale clustering and median location problems by D.-C. programming. Operations Research, 46, 548\u2013562.","journal-title":"Operations Research"},{"key":"1961_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1002\/nav.3800300309","volume":"30","author":"R Chen","year":"1983","unstructured":"Chen, R. (1983). Solution of minisum and minimax location-allocation problems with euclidean distances. Naval Research Logistics Quarterly, 30, 449\u2013459.","journal-title":"Naval Research Logistics Quarterly"},{"key":"1961_CR10","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0377-2217(82)90160-6","volume":"10","author":"N Christofides","year":"1982","unstructured":"Christofides, N., & Beasley, J. E. (1982). A tree search algorithm for the p-median problem. European Journal of Operational Research, 10, 196\u2013204.","journal-title":"European Journal of Operational Research"},{"key":"1961_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1026142406234","volume":"122","author":"RL Church","year":"2003","unstructured":"Church, R. L. (2003). COBRA: A new formulation of the classic p-median location problem. Annals of Operations Research, 122, 103\u2013120.","journal-title":"Annals of Operations Research"},{"key":"1961_CR12","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.cor.2006.03.006","volume":"35","author":"RL Church","year":"2008","unstructured":"Church, R. L. (2008). BEAMR: An exact and approximate model for the p-median problem. Computers & Operations Research, 35, 417\u2013426.","journal-title":"Computers & Operations Research"},{"key":"1961_CR13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/opre.11.3.331","volume":"11","author":"L Cooper","year":"1963","unstructured":"Cooper, L. (1963). Location-allocation problems. Operations Research, 11, 331\u2013343.","journal-title":"Operations Research"},{"key":"1961_CR14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1006005","volume":"6","author":"L Cooper","year":"1964","unstructured":"Cooper, L. (1964). Heuristic methods for location-allocation problems. SIAM Review, 6, 37\u201353.","journal-title":"SIAM Review"},{"key":"1961_CR15","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.18.4.351","volume":"18","author":"Z Drezner","year":"1984","unstructured":"Drezner, Z. (1984). The planar two-center and two-median problems. Transportation Science, 18, 351\u2013361.","journal-title":"Transportation Science"},{"key":"1961_CR16","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.cor.2014.05.010","volume":"62","author":"Z Drezner","year":"2015","unstructured":"Drezner, Z., Brimberg, J., Salhi, S., & Mladenovi\u0107, N. (2015a). New heuristic algorithms for solving the planar \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -median problem. Computers and Operations Research, 62, 296\u2013304.","journal-title":"Computers and Operations Research"},{"key":"1961_CR17","doi-asserted-by":"publisher","unstructured":"Drezner, Z., Brimberg, J., Salhi, S., & Mladenovi\u0107, N. (2015b). New local searches for solving the multi-source Weber problem. Annals of Operations Research. doi:\n                        10.1007\/s10479-015-1797-5\n                        \n                    .","DOI":"10.1007\/s10479-015-1797-5"},{"key":"1961_CR18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/trsc.25.3.183","volume":"25","author":"Z Drezner","year":"1991","unstructured":"Drezner, Z., Mehrez, A., & Wesolowsky, G. O. (1991). The facility location problem with limited distances. Transportation Science, 25, 183\u2013187.","journal-title":"Transportation Science"},{"key":"1961_CR19","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1287\/opre.1030.0077","volume":"52","author":"Z Drezner","year":"2004","unstructured":"Drezner, Z., & Suzuki, A. (2004). The big triangle small triangle method for the solution of non-convex facility location problems. Operations Research, 52, 128\u2013135.","journal-title":"Operations Research"},{"key":"1961_CR20","volume-title":"Distribution management","author":"S Eilon","year":"1971","unstructured":"Eilon, S., Watson-Gandy, C. D. T., & Christofides, N. (1971). Distribution management. New York: Hafner."},{"key":"1961_CR21","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1287\/ijoc.1100.0418","volume":"23","author":"S Garc\u00eda","year":"2011","unstructured":"Garc\u00eda, S., Labb\u00e9, M., & Mar\u00edn, A. (2011). Solving large p-median problems with a radius formulation. INFORMS Journal on Computing, 23, 546\u2013556.","journal-title":"INFORMS Journal on Computing"},{"key":"1961_CR22","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230070203","volume":"7","author":"BL Golden","year":"1977","unstructured":"Golden, B. L., Magnanti, T. L., & Nguyen, H. Q. (1977). Implementing vehicle routing algorithms. Networks, 7, 113\u2013148.","journal-title":"Networks"},{"key":"1961_CR23","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. (1997). Variable neighborhood search for the \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -median. Location Science, 5, 207\u2013226.","journal-title":"Location Science"},{"key":"1961_CR24","first-page":"299","volume":"3","author":"P Hansen","year":"1981","unstructured":"Hansen, P., Peeters, D., & Thisse, J.-F. (1981). On the location of an obnoxious facility. Sistemi Urbani, 3, 299\u2013317.","journal-title":"Sistemi Urbani"},{"key":"1961_CR25","unstructured":"Hillsman, E. (1979). A system for location-allocation analysis. Ph.D. thesis, University of Iowa, Iowa City."},{"key":"1961_CR26","unstructured":"Krau, S. (1997). Extensions du probl\u00e8me de Weber. Ph.D. thesis, \u00c9cole Polytechnique de Montr\u00e9al."},{"key":"1961_CR27","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N., & Supowit, K. J. (1984). On the complexity of some common geometric location problems. SIAM Journal on Computing, 13, 182\u2013196.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"1961_CR28","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1016\/j.ejor.2006.12.064","volume":"191","author":"N Mladenovi\u0107","year":"2008","unstructured":"Mladenovi\u0107, N., Dra\u017ei\u0107, M., Kova\u010devic-Vuj\u010di\u0107, V., & \u010cangalovi\u0107, M. (2008). General variable neighborhood search for the continuous optimization. European Journal of Operational Research, 191(3), 753\u2013770.","journal-title":"European Journal of Operational Research"},{"key":"1961_CR29","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. (1997). Variable neighborhood search. Computers & Operations Research, 24, 1097\u20131100.","journal-title":"Computers & Operations Research"},{"key":"1961_CR30","first-page":"629","volume":"33","author":"BA Murtagh","year":"1982","unstructured":"Murtagh, B. A., & Niwattisyawong, S. R. (1982). An efficient method for the multi-depot location-allocation problem. Journal of the Operational Research Society, 33, 629\u2013634.","journal-title":"Journal of the Operational Research Society"},{"key":"1961_CR31","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0377-2217(92)90244-4","volume":"62","author":"F Plastria","year":"1992","unstructured":"Plastria, F. (1992). GBSSS, the generalized big square small square method for planar single facility location. European Journal of Operational Research, 62, 163\u2013174.","journal-title":"European Journal of Operational Research"},{"key":"1961_CR32","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G. (1991). TSLIB a traveling salesman library. ORSA Journal on Computing, 3, 376\u2013384.","journal-title":"ORSA Journal on Computing"},{"key":"1961_CR33","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0377-2217(96)00100-2","volume":"97","author":"K Rosing","year":"1997","unstructured":"Rosing, K., & ReVelle, C. (1997). Heuristic concentration: A two stage solution construction. European Journal of Operational Research, 97, 75\u201386.","journal-title":"European Journal of Operational Research"},{"key":"1961_CR34","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/0377-2217(92)90072-H","volume":"58","author":"KE Rosing","year":"1992","unstructured":"Rosing, K. E. (1992). An optimal method for solving the (generalized) multi-Weber problem. European Journal of Operational Research, 58, 414\u2013426.","journal-title":"European Journal of Operational Research"},{"key":"1961_CR35","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01434271","volume":"71","author":"KE Rosing","year":"1992","unstructured":"Rosing, K. E., & Harris, B. (1992). Algorithmic and technical improvements: Optimal solutions to the (generalized) multi-Weber problem. Papers in Regional Science, 71, 331\u2013352.","journal-title":"Papers in Regional Science"},{"key":"1961_CR36","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0377-2217(96)00253-6","volume":"103","author":"S Salhi","year":"1997","unstructured":"Salhi, S., & Sari, M. (1997). A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research, 103, 95\u2013112.","journal-title":"European Journal of Operational Research"},{"key":"1961_CR37","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. (2010). The big cube small cube solution method for multidimensional facility location problems. Computers and Operations Research, 37, 115\u2013122.","journal-title":"Computers and Operations Research"},{"key":"1961_CR38","first-page":"221","volume":"3","author":"PA Sorensen","year":"1995","unstructured":"Sorensen, P. A., & Church, R. L. (1995). A comparison of strategies for data storage reduction in location-allocation problems. Geographical Systems, 3, 221\u2013242.","journal-title":"Geographical Systems"},{"key":"1961_CR39","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1021841728075","volume":"9","author":"\u00c9 Taillard","year":"2003","unstructured":"Taillard, \u00c9. (2003). Heuristic methods for large centroid clustering problems. Journal of Heuristics, 9, 51\u201373.","journal-title":"Journal of Heuristics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1961-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-1961-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1961-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1961-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:10:01Z","timestamp":1559139001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-1961-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,12]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1961"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-1961-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,12]]}}}