{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T11:38:06Z","timestamp":1768736286555,"version":"3.49.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T00:00:00Z","timestamp":1423094400000},"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":[[2016,11]]},"DOI":"10.1007\/s10479-015-1797-5","type":"journal-article","created":{"date-parts":[[2015,2,4]],"date-time":"2015-02-04T17:55:50Z","timestamp":1423072550000},"page":"181-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["New local searches for solving the multi-source Weber problem"],"prefix":"10.1007","volume":"246","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":[[2015,2,5]]},"reference":[{"key":"1797_CR1","volume-title":"Handbook of discrete and combinatorial mathematics","author":"D Aloise","year":"2009","unstructured":"Aloise, D., & Hansen, P. (2009). Clustering. In D. Shier (Ed.), Handbook of discrete and combinatorial mathematics. Boca Raton, FL: CRC Press."},{"key":"1797_CR2","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":"1797_CR3","volume-title":"Standard mathematical tables","author":"HW Beyer","year":"1981","unstructured":"Beyer, H. W. (1981). Standard mathematical tables. Boca Raton, FL: CRC Press."},{"key":"1797_CR4","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 $$\\ell _p$$ \u2113 p norm location\u2013allocation problems. Mathematical Programming, 66, 238\u2013312.","journal-title":"Mathematical Programming"},{"key":"1797_CR5","doi-asserted-by":"crossref","unstructured":"Brimberg, J., Drezner, Z., Mladenovic, N., & Salhi, S. (2012a). Generating good starting solutions for the p-median problem in the plane. Presented at the EUROmC-XXVIII-VNS conference, October, 2012, Belgrade, Serbia.","DOI":"10.1016\/j.endm.2012.10.030"},{"key":"1797_CR6","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":"1797_CR7","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\u2013allocation problems. IMA Journal of Management Mathematics, 17, 307\u2013316.","journal-title":"IMA Journal of Management Mathematics"},{"key":"1797_CR8","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\u2013allocation problem. International Journal of Operations Research, 5, 1\u201312.","journal-title":"International Journal of Operations Research"},{"key":"1797_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.endm.2012.10.030","volume":"39","author":"J Brimberg","year":"2012","unstructured":"Brimberg, J., Drezner, Z., Mladenovic, N., & Salhi, S. (2012b). Generating good starting solutions for the p-median problem in the plane. Electronic Notes in Discrete Mathematics, 39, 225\u2013232.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"1797_CR10","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 and Operations Research, 40, 427\u2013437.","journal-title":"Computers and Operations Research"},{"key":"1797_CR11","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":"1797_CR12","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01934511","volume":"24","author":"S Carlsson","year":"1984","unstructured":"Carlsson, S. (1984). Improving worst-case behavior of heaps. BIT Numerical Mathematics, 24, 14\u201318.","journal-title":"BIT Numerical Mathematics"},{"key":"1797_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.2298\/YJOR1102157C","volume":"21","author":"E Carrizosa","year":"2011","unstructured":"Carrizosa, E., Mladenovi\u0107, N., & Todosijevic, R. (2011). Sum-of-squares clustering on networks. Yugoslav Journal of Operations Research, 21, 157\u2013161.","journal-title":"Yugoslav Journal of Operations Research"},{"key":"1797_CR14","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\u2013allocation problems with euclidean distances. Naval Research Logistics Quarterly, 30, 449\u2013459.","journal-title":"Naval Research Logistics Quarterly"},{"key":"1797_CR15","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":"1797_CR16","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\u2013allocation problems. Operations Research, 11, 331\u2013343.","journal-title":"Operations Research"},{"key":"1797_CR17","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\u2013allocation problems. SIAM Review, 6, 37\u201353.","journal-title":"SIAM Review"},{"key":"1797_CR18","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":"1797_CR19","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":"1797_CR20","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":"1797_CR21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s12159-012-0093-x","volume":"6","author":"Z Drezner","year":"2013","unstructured":"Drezner, Z. (2013). Solving planar location problems by global optimization. Logistics Research, 6, 17\u201323.","journal-title":"Logistics Research"},{"key":"1797_CR22","volume-title":"Distribution management","author":"S Eilon","year":"1971","unstructured":"Eilon, S., Watson-Gandy, C. D. T., & Christofides, N. (1971). Distribution management. New York, NY: Hafner."},{"key":"1797_CR23","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D Erlenkotter","year":"1978","unstructured":"Erlenkotter, D. (1978). A dual-based procedure for uncapacitated facility location. Operations Research, 26, 992\u20131009.","journal-title":"Operations Research"},{"key":"1797_CR24","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/mnsc.12.9.670","volume":"12","author":"E Feldman","year":"1966","unstructured":"Feldman, E., Lehrer, F. A., & Ray, T. L. (1966). Warehouse location under continuous economies of scale. Management Science, 12, 670\u2013684.","journal-title":"Management Science"},{"key":"1797_CR25","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. (1986). Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, 6, 109\u2013122.","journal-title":"Combinatorica"},{"key":"1797_CR26","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":"1797_CR27","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 $$p$$ p -median. Location Science, 5, 207\u2013226.","journal-title":"Location Science"},{"key":"1797_CR28","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0167-6377(98)00004-2","volume":"22","author":"P Hansen","year":"1998","unstructured":"Hansen, P., Mladenovi\u0107, N., & Taillard, \u00c9. (1998). Heuristic solution of the multisource Weber problem as a p-median problem. Operations Research Letters, 22, 55\u201362.","journal-title":"Operations Research Letters"},{"key":"1797_CR29","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., Urosevi\u0107, D., & Mladenovi\u0107, N. (2007). Primal-dual variable neighborhood for the simple plant location problem. INFORMS Journal of Computing, 19, 552\u2013564.","journal-title":"INFORMS Journal of Computing"},{"key":"1797_CR30","unstructured":"Hilbert, D., & Cohn-Vossen, S. (1956). Geometry and the Imagination. Chelsea Publishing Company, New York. English translation of Anschauliche Geometrie (1932)."},{"key":"1797_CR31","unstructured":"Krau, S. (1997). Extensions du probl\u00e8me de Weber. PhD thesis, \u00c9cole Polytechnique de Montr\u00e9al."},{"key":"1797_CR32","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"AA Kuehn","year":"1963","unstructured":"Kuehn, A. A., & Hamburger, M. J. (1963). A heuristic program for locating warehouses. Management Science, 9, 643\u2013666.","journal-title":"Management Science"},{"key":"1797_CR33","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01584989","volume":"3","author":"RE Kuenne","year":"1972","unstructured":"Kuenne, R. E., & Soland, R. M. (1972). Exact and approximate solutions to the multisource weber problem. Mathematical Programming, 3, 193\u2013209.","journal-title":"Mathematical Programming"},{"issue":"3","key":"1797_CR34","first-page":"219","volume":"9","author":"DT Lee","year":"1980","unstructured":"Lee, D. T., & Schachter, B. J. (1980). Two algorithms for constructing a Delaunay triangulation. International Journal of Parallel Programming, 9(3), 219\u2013242.","journal-title":"International Journal of Parallel Programming"},{"key":"1797_CR35","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"},{"key":"1797_CR36","volume-title":"Algorithms and data structures: The basic toolbox","author":"K Mehlhorn","year":"2008","unstructured":"Mehlhorn, K., & Sanders, P. (2008). Algorithms and data structures: The basic toolbox. Berlin: Springer."},{"key":"1797_CR37","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1051\/ro\/1991250100971","volume":"25","author":"JA Moreno-P\u00e9rez","year":"1991","unstructured":"Moreno-P\u00e9rez, J. A., Rodr\u00ecguez, C., & Jimenez, N. (1991). Heuristic cluster algorithm for multiple facility location\u2013allocation problem. RAIRO, 25, 97\u2013107.","journal-title":"RAIRO"},{"key":"1797_CR38","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\u2013allocation problem. Journal of the Operational Research Society, 33, 629\u2013634.","journal-title":"Journal of the Operational Research Society"},{"key":"1797_CR39","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. (1984). Improvements of the incremental method of the Voronoi diagram with computational comparison of various algorithms. Journal of the Operations Research Society of Japan, 27, 306\u2013337.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"1797_CR40","unstructured":"Ostresh Jr, L. M. (1973). TWAIN\u2014exact solutions to the two-source location\u2013allocation problem. In Rushton, G., Goodchild, M., & Ostresh Jr., L. (Eds.), Computer programs for location-allocation problems (pp. 15\u201328)."},{"key":"1797_CR41","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1111\/j.1467-9787.1975.tb00921.x","volume":"15","author":"LM Ostresh Jr","year":"1975","unstructured":"Ostresh, L. M, Jr. (1975). An efficient algorithm for solving the two center location\u2013allocation problem. Journal of Regional Science, 15, 209\u2013216.","journal-title":"Journal of Regional Science"},{"key":"1797_CR42","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":"1797_CR43","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":"1797_CR44","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":"1797_CR45","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":"1797_CR46","volume-title":"Geometric clusterings","author":"G Rote","year":"1989","unstructured":"Rote, G., & Woeginger, G. (1989). Geometric clusterings. Fachbereich Mathematik: Freie University."},{"key":"1797_CR47","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0966-8349(96)00003-4","volume":"3","author":"S Salhi","year":"1995","unstructured":"Salhi, S., & Atkinson, R. A. (1995). Subdrop: A modified drop heuristic for location problems. Location Science, 3, 267\u2013273.","journal-title":"Location Science"},{"key":"1797_CR48","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":"1797_CR49","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1142\/S0218195994000124","volume":"4","author":"K Sugihara","year":"1994","unstructured":"Sugihara, K., & Iri, M. (1994). A robust topology-oriented incremental algorithm for Voronoi diagram. International Journal of Computational Geometry and Applications, 4, 179\u2013228.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"1797_CR50","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"MB Teitz","year":"1968","unstructured":"Teitz, M. B., & Bart, P. (1968). Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16, 955\u2013961.","journal-title":"Operations Research"},{"key":"1797_CR51","unstructured":"Tornqvist, G., Nordbeck, S., Rystedt, B., & Gould, P. (1971). Multiple location analysis. In Lund Studies in Geography, Ser C., General, Mathematical and Regional Geography, No. 12. University of Lund, Sweden."},{"key":"1797_CR52","first-page":"49","volume":"8","author":"S Voss","year":"1996","unstructured":"Voss, S. (1996). A reverse elimination approach for the p-median problem. Studies in Locational Analysis, 8, 49\u201358.","journal-title":"Studies in Locational Analysis"},{"key":"1797_CR53","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1287\/opre.21.1.314","volume":"21","author":"RE Wendell","year":"1973","unstructured":"Wendell, R. E., & Hurter, A. P. (1973). Location theory, dominance and convexity. Operations Research, 21, 314\u2013320.","journal-title":"Operations Research"},{"key":"1797_CR54","first-page":"95","volume":"21","author":"R Whitaker","year":"1983","unstructured":"Whitaker, R. (1983). A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR, 21, 95\u2013108.","journal-title":"INFOR"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1797-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-1797-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1797-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1797-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T16:43:38Z","timestamp":1566319418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-1797-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,5]]},"references-count":54,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1797"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-1797-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,5]]}}}