{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T12:28:04Z","timestamp":1768480084207,"version":"3.49.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0305-0548(02)00191-0","type":"journal-article","created":{"date-parts":[[2003,2,4]],"date-time":"2003-02-04T20:48:55Z","timestamp":1044391735000},"page":"257-272","source":"Crossref","is-referenced-by-count":47,"title":["A heuristic method for large-scale multi-facility location problems"],"prefix":"10.1016","volume":"31","author":[{"given":"Yuri","family":"Levin","sequence":"first","affiliation":[]},{"given":"Adi","family":"Ben-Israel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00191-0_BIB1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02614317","article-title":"Cluster analysis and mathematical programming","volume":"79","author":"Hansen","year":"1997","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1006005","article-title":"Heuristic methods for location\u2013allocation problems","volume":"6","author":"Cooper","year":"1964","journal-title":"SIAM Review"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB3","series-title":"Cluster analysis","author":"Duran","year":"1974"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB4","series-title":"Cluster analysis and data analysis","author":"Jambu","year":"1983"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB5","series-title":"Cluster analysis","author":"Everitt","year":"1993"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB6","series-title":"Facility location: a survey of applications and methods","author":"Drezner","year":"1995"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB7","unstructured":"Ghosh A, Rushton G, editors. Spatial analysis and location\u2013allocation models. New York: Van Nostrand Reinhold, 1987."},{"key":"10.1016\/S0305-0548(02)00191-0_BIB8","series-title":"Facilities location: models & methods","author":"Love","year":"1988"},{"issue":"3","key":"10.1016\/S0305-0548(02)00191-0_BIB9","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","article-title":"Improvements and comparison of heuristics for solving the multisource Weber problem","volume":"48","author":"Brimberg","year":"2000","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB10","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1016\/S0305-0548(99)00039-8","article-title":"Allocation of discrete demand with changing costs","volume":"26","author":"Drezner","year":"1999","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1111\/j.1467-9787.1994.tb00865.x","article-title":"Locating a single new facility among existing, unequally attractive facilities","volume":"34","author":"Drezner","year":"1994","journal-title":"Journal of Regional Science"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0377-2217(83)90180-7","article-title":"On locating new facilities in a competitive environment","volume":"12","author":"Hakimi","year":"1983","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB13","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1287\/opre.35.4.565","article-title":"Competitive location on a network","volume":"35","author":"Dobson","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB14","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/0305-0548(86)90073-0","article-title":"On the set partitioning type formulation for the discrete location problem","volume":"13","author":"Darzentas","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB15","first-page":"355","article-title":"Sur le point par 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\/S0305-0548(02)00191-0_BIB16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1013768901780","article-title":"The Newton Bracketing method for convex minimization","volume":"21","author":"Levin","year":"2002","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB17","series-title":"Introduction to statistical pattern recognition","author":"Fukunaga","year":"1990"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB18","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/BF01584648","article-title":"A note on Fermat's problem","volume":"4","author":"Kuhn","year":"1973","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01580224","article-title":"Local convergence in Fermat's problem","volume":"6","author":"Katz","year":"1974","journal-title":"Mathematical Programming"},{"issue":"3","key":"10.1016\/S0305-0548(02)00191-0_BIB20","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01587094","article-title":"Open questions concerning Weiszfeld's algorithm for the Fermat\u2013Weber location problem","volume":"44","author":"Chandrasekaran","year":"1989","journal-title":"Mathematical Programming Series A"},{"key":"10.1016\/S0305-0548(02)00191-0_BIB21","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1090\/S0025-5718-01-01332-1","article-title":"Directional Newton methods in n variables","volume":"71","author":"Levin","year":"2002","journal-title":"Mathematics of Computation"},{"issue":"4","key":"10.1016\/S0305-0548(02)00191-0_BIB22","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0966-8349(96)00004-6","article-title":"A note on accelerating the Weiszfeld procedure","volume":"3","author":"Drezner","year":"1995","journal-title":"Location Science"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001910?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001910?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:56:52Z","timestamp":1553914612000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802001910"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0305054802001910"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00191-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}