{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:47:59Z","timestamp":1774421279278,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0377-2217(02)00211-4","type":"journal-article","created":{"date-parts":[[2002,12,2]],"date-time":"2002-12-02T11:31:35Z","timestamp":1038828695000},"page":"483-495","source":"Crossref","is-referenced-by-count":11,"title":["Center problems with pos\/neg weights on trees"],"prefix":"10.1016","volume":"145","author":[{"given":"R.E.","family":"Burkard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helidon","family":"Dollani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00211-4_BIB1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02684332","article-title":"A linear algorithm for the pos\/neg-weighted 1-median problem on a cactus","volume":"60","author":"Burkard","year":"1998","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB2","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1137\/S0895480198340967","article-title":"The obnoxious center problem on a tree","volume":"14","author":"Burkard","year":"2001","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB3","unstructured":"P. Cappanera, A survey on obnoxious facility location problems, Technical Report: TR-99-11, Department of Computer Science, University of Pisa, April 1999"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB4","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1287\/opre.24.4.628","article-title":"Convex location problems on tree networks","volume":"24","author":"Dearing","year":"1976","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB5","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"1997"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB6","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB7","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimal locations of switching centers and the absolute centers and medians of a graph","volume":"12","author":"Hakimi","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB8","series-title":"Discrete Location Theory","first-page":"305","article-title":"p-Center problems","author":"Handler","year":"1990"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB9","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","article-title":"An algorithmic approach to network location problems. I: The p-centers","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/trsc.28.1.77","article-title":"The discrete anti-p-center problem","volume":"28","author":"Klein","year":"1994","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0020-0190(99)00111-8","article-title":"A linear-time algorithm for solving the center problem on weighted cactus graphs","volume":"71","author":"Lan","year":"1999","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB12","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/0212051","article-title":"Linear-time algorithms for linear programming in R3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB13","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1137\/0210023","article-title":"An O(nlog2n) algorithm for the kth longest path in a tree with application to location problems","volume":"10","author":"Megiddo","year":"1981","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB14","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","article-title":"Maintenance of configurations in the plane","volume":"23","author":"Overmars","year":"1981","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB15","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1137\/0401038","article-title":"Improved complexity bounds for center location problems on networks by using dynamic data structures","volume":"1","author":"Tamir","year":"1988","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB16","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0404048","article-title":"Obnoxious facility location on graphs","volume":"4","author":"Tamir","year":"1991","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(02)00211-4_BIB17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/moor.7.2.183","article-title":"Locating centers on a tree with discontinuous supply and demand regions","volume":"7","author":"Tamir","year":"1982","journal-title":"Mathematics of Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002114?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002114?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T09:25:46Z","timestamp":1556702746000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702002114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0377221702002114"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00211-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}