{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T10:31:36Z","timestamp":1722594696871},"reference-count":48,"publisher":"Elsevier BV","issue":"2","content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1016\/j.ejor.2013.06.022","type":"journal-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T13:38:16Z","timestamp":1372167496000},"page":"256-265","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":60,"title":["A new local search for continuous location problems"],"prefix":"10.1016","volume":"232","author":[{"given":"Jack","family":"Brimberg","sequence":"first","affiliation":[]},{"given":"Zvi","family":"Drezner","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]},{"given":"Said","family":"Salhi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2013.06.022_b0005","article-title":"Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem","author":"Aky\u00fcz","year":"2013","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2013.06.022_b0010","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1002\/nav.20176","article-title":"New heuristic methods for the capacitated multi-facility Weber problem","volume":"54","author":"Aras","year":"2007","journal-title":"Naval Research Logistics"},{"issue":"1","key":"10.1016\/j.ejor.2013.06.022_b0015","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1057\/palgrave.jors.2602262","article-title":"Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem","volume":"59","author":"Aras","year":"2008","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2013.06.022_b0020","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01581151","article-title":"A projection method for lp norm location-allocation problems","volume":"66","author":"Bongartz","year":"1994","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2013.06.022_b0025","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1080\/0740817X.2012.695100","article-title":"Approximate solutions methods for the capacitated multi-facility Weber problem","volume":"43","author":"Boyaci","year":"2013","journal-title":"IIE Transactions"},{"key":"10.1016\/j.ejor.2013.06.022_b0030","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.cor.2012.07.012","article-title":"A new heuristic for solving the p-median problem in the plane","volume":"40","author":"Brimberg","year":"2013","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0035","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.endm.2012.10.030","article-title":"Generating good starting solutions for the p-median problem in the plane","volume":"39","author":"Brimberg","year":"2013","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10.1016\/j.ejor.2013.06.022_b0040","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10288-009-0108-x","article-title":"Attraction probabilities in variable neighbourhood search","volume":"8","author":"Brimberg","year":"2010","journal-title":"4OR-Quarterly Journal of Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0045","first-page":"1","article-title":"A survey of solution methods for the continuous location-allocation problem","volume":"5","author":"Brimberg","year":"2008","journal-title":"International Journal of Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2013.06.022_b0050","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","article-title":"Improvement and comparison of heuristics for solving the uncapacitated multisource Weber problem","volume":"48","author":"Brimberg","year":"2000","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0055","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1057\/palgrave.jors.2601754","article-title":"The multi-source Weber problem with constant opening cost","volume":"55","author":"Brimberg","year":"2004","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2013.06.022_b0060","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10479-005-2041-5","article-title":"A continuous location-allocation problem with zone-dependent fixed cost","volume":"136","author":"Brimberg","year":"2005","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0065","series-title":"Methods and applications of statistics in business","first-page":"139","article-title":"Estimation of travel distance","author":"Brimberg","year":"2010"},{"key":"10.1016\/j.ejor.2013.06.022_b0070","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/opre.11.3.331","article-title":"Location-allocation problems","volume":"11","author":"Cooper","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0075","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1006005","article-title":"Heuristic methods for location-allocation problems","volume":"6","author":"Cooper","year":"1964","journal-title":"SIAM Review"},{"key":"10.1016\/j.ejor.2013.06.022_b0080","unstructured":"Drezner, Z., Brimberg, J., Mladenovi\u0107, N., & Salhi, S. (submitted for publication). Effective solutions to the p-median problem in the plane."},{"key":"10.1016\/j.ejor.2013.06.022_b0085","unstructured":"du Merle, O., Villeneuve, D., Desrosiers, J., & Hansen, P. (1997). Stabilization dans le cadre de la g\u00e9n\u00e9ration de colonnes. Les cahiers du GERAD G-97-08, University of Montreal."},{"issue":"7","key":"10.1016\/j.ejor.2013.06.022_b0090","doi-asserted-by":"crossref","first-page":"2139","DOI":"10.1016\/j.cor.2008.08.003","article-title":"Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations","volume":"36","author":"Durmaz","year":"2009","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0095","series-title":"Distribution management","author":"Eilon","year":"1971"},{"key":"10.1016\/j.ejor.2013.06.022_b0100","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","article-title":"Analytical models for locating undesirable facilities","volume":"40","author":"Erkut","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0105","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","article-title":"A dual-based procedure for uncapacitated facility location","volume":"26","author":"Erlenkotter","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0110","series-title":"Facility layout and location: An analytical approach","author":"Francis","year":"1992"},{"key":"10.1016\/j.ejor.2013.06.022_b0115","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1057\/palgrave.jors.2601176","article-title":"Constructive heuristics for the uncapacitated continuous location-allocation problem","volume":"52","author":"Gamal","year":"2001","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2013.06.022_b0120","doi-asserted-by":"crossref","first-page":"1603","DOI":"10.1016\/S0305-0548(02)00095-3","article-title":"A cellular heuristic for the multisource Weber problem","volume":"30","author":"Gamal","year":"2003","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0125","unstructured":"Hansen, P., Krau, S., & du Merle, O. (2000). Stabilized column generation algorithm for the multisource Weber problem. Les cahiers du GERAD G-2000-62, University of Montreal."},{"key":"10.1016\/j.ejor.2013.06.022_b0130","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","article-title":"Variable neighborhood search: Methods and applications","volume":"175","author":"Hansen","year":"2010","journal-title":"Annals of OR"},{"key":"10.1016\/j.ejor.2013.06.022_b0135","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0167-6377(98)00004-2","article-title":"Heuristic solution of the multisource Weber problem as a p-median problem","volume":"22","author":"Hansen","year":"1998","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.ejor.2013.06.022_b0140","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1287\/opre.28.5.1241","article-title":"Location theory, dominance, and convexity: Some further results","volume":"28","author":"Hansen","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0145","unstructured":"Krau, S. (1997). Extensions du probl\u00e8me de Weber. PhD Thesis, Ecole Polytechnique de Montreal, Montreal."},{"key":"10.1016\/j.ejor.2013.06.022_b0150","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01584989","article-title":"Exact and approximate solutions to the multisource Weber problem","volume":"3","author":"Kuenne","year":"1972","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2013.06.022_b0155","series-title":"Facilities location: Models and methods","author":"Love","year":"1988"},{"key":"10.1016\/j.ejor.2013.06.022_b0160","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1137\/0213014","article-title":"On the complexity of some common geometric location problems","volume":"13","author":"Megiddo","year":"1984","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.ejor.2013.06.022_b0165","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","article-title":"The p-median problem: A survey of metaheuristic approaches","volume":"179","author":"Mladenovi\u0107","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0170","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighbourhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0175","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1016\/j.cor.2004.03.010","article-title":"Reformulation descent applied to a circle packing problem","volume":"32","author":"Mladenovi\u0107","year":"2005","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0180","doi-asserted-by":"crossref","first-page":"19","DOI":"10.2298\/YJOR120530015M","article-title":"An efficient general variable neighborhood search for large TSP problems with time windows","volume":"23","author":"Mladenovi\u0107","year":"2013","journal-title":"Yugoslav Journal of Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0185","series-title":"Location theory: A unified approach","author":"Nickel","year":"2005"},{"key":"10.1016\/j.ejor.2013.06.022_b0190","unstructured":"Ostresh Jr. L.M. (1973). Multi-exact solutions to the M-center location-allocation problem. In G. Rushton, M. F. Goodchild & L. M. Ostresh Jr. (Eds.), Computer Programs for Location-Allocation Problems. Monograph No. 6, University of Iowa, IA."},{"key":"10.1016\/j.ejor.2013.06.022_b0195","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSLIB-a travelling salesman library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/j.ejor.2013.06.022_b0200","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/0377-2217(92)90072-H","article-title":"An optimal method for solving the (generalized) multi-Weber problem","volume":"58","author":"Rosing","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0205","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0377-2217(96)00253-6","article-title":"A multi-level composite heuristic for the multi-depot vehicle fleet mix problem","volume":"103","author":"Salhi","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0210","series-title":"Combinatorial programming, spatial analysis and planning","author":"Scott","year":"1971"},{"key":"10.1016\/j.ejor.2013.06.022_b0215","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1021841728075","article-title":"Heuristic methods for large centroid clustering problems","volume":"9","author":"Taillard","year":"2003","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.ejor.2013.06.022_b0220","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","article-title":"Heuristic methods for estimating the generalized vertex median of a weighted graph","volume":"16","author":"Teitz","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0225","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.28.3.836","article-title":"A new norm for measuring distance which yields linear location problems","volume":"28","author":"Ward","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0230","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1287\/opre.33.5.1074","article-title":"Using block norms for location modeling","volume":"33","author":"Ward","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2013.06.022_b0235","first-page":"355","article-title":"Sur le point pour lequel la somme des distances de n points donn\u00e9s est minimum","volume":"43","author":"Weiszfeld","year":"1937","journal-title":"Tohoku Mathematical Journal"},{"key":"10.1016\/j.ejor.2013.06.022_b0240","first-page":"95","article-title":"A fast algorithm for the greedy-interchange for large-scale clustering and median location problems","volume":"21","author":"Whitaker","year":"1983","journal-title":"INFOR"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221713005109?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221713005109?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T02:22:13Z","timestamp":1539570133000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221713005109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["S0377221713005109"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2013.06.022","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2014,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new local search for continuous location problems","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2013.06.022","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. Published by Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
