{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:34:47Z","timestamp":1760729687157},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"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":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s1571-0653(04)00235-5","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"102-105","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["ADD\/DROP PROCEDURES FOR THE CAPACITATED PLANT LOCATION PROBLEM"],"prefix":"10.1016","volume":"7","author":[{"given":"Manoel","family":"Camp\u00ealo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cl\u00e9udio Thomaz","family":"Bornstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00235-5_BIB1","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1287\/mnsc.23.6.585","article-title":"An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem","volume":"23","author":"Akinc","year":"1977","journal-title":"Mgmt Sci."},{"key":"10.1016\/S1571-0653(04)00235-5_BIB2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0377-2217(91)90091-9","article-title":"Computational Results from a New Lagrangean Relaxation Algorithm for the Capacitated Plant Location Problem","volume":"53","author":"Barcelo","year":"1991","journal-title":"Eur. J. Opl Res"},{"key":"10.1016\/S1571-0653(04)00235-5_BIB3","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/0377-2217(88)90175-0","article-title":"An Algorithm for Solving Large Capacitated Warehouse Location Problems","volume":"33","author":"Beasley","year":"1988","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/S1571-0653(04)00235-5_BIB4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-Library: distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Opl Res. Soc."},{"key":"10.1016\/S1571-0653(04)00235-5_BIB5","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","article-title":"Lagrangean Heuristics for Location Problems","volume":"65","author":"Beasley","year":"1993","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/S1571-0653(04)00235-5_BIB6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0966-8349(98)00062-X","article-title":"The Use of Reduction Tests and Simulated Annealing for the Capacitated Plant Location Problem","volume":"6","author":"Bornstein","year":"1988","journal-title":"Location Sci."},{"key":"10.1016\/S1571-0653(04)00235-5_BIB7","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0377-2217(91)90261-S","article-title":"A comparison of Heuristics and Relaxations for the Capacitated Plant Location Problem","volume":"50","author":"Cornuejols","year":"1991","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/S1571-0653(04)00235-5_BIB8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0377-2217(83)90195-9","article-title":"Heuristics for the Capacitated Plant Location Problem","volume":"12","author":"Jacobsen","year":"1983","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/S1571-0653(04)00235-5_BIB9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1057\/jors.1991.25","article-title":"Dominance Criteria for the Capacitated Warehouse Location Problem","volume":"42","author":"Mateus","year":"1991","journal-title":"J. Opl Res. Soc."},{"key":"10.1016\/S1571-0653(04)00235-5_BIB10","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S1571-0653(04)00235-5_BIB11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.34.1.145","article-title":"A Cross Decomposition Algorithm for Capacitated Facility Location","volume":"34","author":"Van Roy","year":"1986","journal-title":"Opns Res."},{"key":"10.1016\/S1571-0653(04)00235-5_BIB12","unstructured":"Wolsey L.A. (1983). Fundamental Properties of Certain Discrete Location Problems. In: Thisse J.-F. and Zoller H.G. (eds). Locational Analysis of Public Facilities. North-Holland, pp 331-355."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002355?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002355?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T13:50:36Z","timestamp":1548597036000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304002355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":12,"alternative-id":["S1571065304002355"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00235-5","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}