{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T22:02:12Z","timestamp":1746309732837},"reference-count":26,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0167-6377(98)00004-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"55-62","source":"Crossref","is-referenced-by-count":90,"title":["Heuristic solution of the multisource Weber problem as a p-median problem"],"prefix":"10.1016","volume":"22","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]},{"given":"\u00c9ric","family":"Taillard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00004-2_BIB1","unstructured":"E.B. Baum, Toward practical neural computation for combinatorial optimization problems, in: J. Denker (Ed.), Neural Networks for Computing, American Institute of Physics, College Park, MD 1996."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","article-title":"A new adaptive multi-start technique for combinatorial global optimizations","volume":"16","author":"Boese","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01581151","article-title":"A projection method forlp norm location-allocation problems","volume":"66","author":"Bongartz","year":"1994","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00004-2_BIB4","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1287\/opre.41.6.1153","article-title":"Global convergence of a generalized iterative procedure for the minisum location problem withlp distances","volume":"41","author":"Brimberg","year":"1993","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB5","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1137\/0901037","article-title":"A stable algorithm for solving the multifacility location problem involving Euclidean distances","volume":"1","author":"Calamai","year":"1980","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB6","unstructured":"P.-C. Chen, P. Hansen, B. Jaumard, H. Tuy, Solution of the multisource Weber and conditional Weber problems by d.-c. programming, GERAD Research Report G-92-35, University of Montreal, Canada, 1992, Oper. Res., to appear."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/opre.11.3.331","article-title":"Location-allocation problems","volume":"11","author":"Cooper","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB8","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 Rev."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB10","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(85)90012-8","article-title":"A comparison of two dual-based procedures for solving thep-median problem","volume":"20","author":"Hanjoul","year":"1985","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB11","unstructured":"P. Hansen, B. Jaumard, S. Krau O. du Merle, A stabilized column generation algorithm for the multisource Weber problem, GERAD Research Report, 1998, forthcoming."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB12","doi-asserted-by":"crossref","unstructured":"P. Hansen, N. Mladenovi\u0107, Variable neighbourhood search for thep-median, GERAD Research Report G-97-39, 1997; Location Sci, to appear.","DOI":"10.1016\/S0966-8349(98)00030-8"},{"key":"10.1016\/S0167-6377(98)00004-2_BIB13","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","article-title":"An algorithmic approach to network location problems; part 2. Thep-medians","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB14","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":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00004-2_BIB15","series-title":"Facilities Location: Models and Methods","author":"Love","year":"1988"},{"key":"10.1016\/S0167-6377(98)00004-2_BIB16","doi-asserted-by":"crossref","unstructured":"N. Megiddo, K.J. Supowit, On the complexity of some common geometric location problems, SIAM J. Comput. 13 (1984) 182\u2013196.","DOI":"10.1137\/0213014"},{"key":"10.1016\/S0167-6377(98)00004-2_BIB17","unstructured":"L.M. Ostresh Jr., Twain \u2013 exact solutions to the two source location-allocation problem, in: G. Rushton, M.F. Goodchild, L.M. Ostresh Jr. (Eds.), Computer Programs for Location-Allocation Problems, Monograph Number 6, Department of Geography, University of Iowa, Iowa City, IA, 1973a, pp. 15\u201328."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB18","unstructured":"L.M. Ostresh Jr., MULTI \u2013 exact solutions to theM-center location-allocation problem, in: G. Rushton, M.F. Goodchild, L.M. Ostresh Jr. (Eds.), Computer Programs for Location-Allocation Problems, Monograph Number 6, Department of Geography, University of Iowa, Iowa City, 1973b, pp. 29\u201353."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB19","unstructured":"L.M. Ostresh Jr., An investigation of the multiple location-allocation problem, PhD Thesis, The University of Iowa, Iowa City, IA, 1973c."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB20","doi-asserted-by":"crossref","unstructured":"L.M. Ostresh Jr., An efficient algorithm for solving the two center location-allocation problem, J. Regional Sci. 15 (1975) 209\u2013216.","DOI":"10.1111\/j.1467-9787.1975.tb00921.x"},{"key":"10.1016\/S0167-6377(98)00004-2_BIB21","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/BF02591963","article-title":"A quadratically convergent method for minimizing a sum of Euclidean norms","volume":"27","author":"Overton","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00004-2_BIB22","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/ijoc.3.3.207","article-title":"Computational comparison of two algorithms for the Euclidean single facility location problem","volume":"3","author":"Rosen","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB23","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":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB24","first-page":"355","article-title":"Sur le point pour lequel la somme des distances den points donn\u00e9s est minimum","volume":"43","author":"Weiszfeld","year":"1937","journal-title":"T\u00f4hoku Math. J."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB25","first-page":"5","article-title":"The Weber problem: history and perspectives","volume":"1","author":"Wesolowsky","year":"1993","journal-title":"Location Sci."},{"key":"10.1016\/S0167-6377(98)00004-2_BIB26","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"},{"key":"10.1016\/S0167-6377(98)00004-2_BIB27","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0167-6377(95)00050-X","article-title":"A polynomial time dual algorithm for the Euclidean multifacility location problem","volume":"18","author":"Xue","year":"1996","journal-title":"Oper. Res. Lett."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000042?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000042?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:54:23Z","timestamp":1555577663000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":26,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0167637798000042"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00004-2","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}