{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T04:17:21Z","timestamp":1783311441917,"version":"3.54.6"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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,8]]},"DOI":"10.1016\/s0377-2217(02)00464-2","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"53-64","source":"Crossref","is-referenced-by-count":28,"title":["Dominant, an algorithm for the p-center problem"],"prefix":"10.1016","volume":"149","author":[{"given":"C.","family":"Caruso","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Colorni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.","family":"Aloi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00464-2_BIB1","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","article-title":"A note on solving large p-median problems","volume":"21","author":"Beasley","year":"1985","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB2","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":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB3","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/BF01581045","article-title":"Polynomially bounded algorithms for locating p-centers on a tree","volume":"22","author":"Chandrasekaran","year":"1982","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB4","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1287\/mnsc.21.5.591","article-title":"A computational survey of methods for the set covering problem","volume":"21","author":"Christofides","year":"1975","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB5","series-title":"Network and Discrete Location: Models, Algorithms and Applications","author":"Daskin","year":"1995"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB6","first-page":"741","article-title":"The p-center problem: Heuristic and optimal algorithms","volume":"35","author":"Drezner","year":"1984","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB8","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimal location 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)00464-2_BIB9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/trsc.12.2.93","article-title":"Finding two-centers of a tree: The continuos case","volume":"12","author":"Handler","year":"1978","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB10","first-page":"305","article-title":"P-center Problems, in Discrete Location Theory","author":"Handler","year":"1990"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB11","series-title":"Location on Networks","author":"Handler","year":"1979"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB12","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/BF01583786","article-title":"Worst case analysis of a class of set covering heuristics","volume":"23","author":"Ho","year":"1982","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB13","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1002\/net.3230150308","article-title":"Algorithms for finding p-centers on a weighted tree","volume":"15","author":"Jaeger","year":"1985","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB14","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","article-title":"An algorithmic approach to network location problems. Part 1. The p-centers","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB15","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)00464-2_BIB16","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1137\/1012016","article-title":"The m-center problem","volume":"12","author":"Minieka","year":"1970","journal-title":"SIAM Review"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB17","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/net.3230100307","article-title":"Conditional centers and medians on a graph","volume":"10","author":"Minieka","year":"1980","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1051\/ro\/1991250100651","article-title":"Heuristic methods for the p-center problem","volume":"25","author":"Pelegrin","year":"1991","journal-title":"RAIRO Recherche Operationelle"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB19","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1002\/nav.3800310118","article-title":"An efficient heuristic for large set covering problems","volume":"31","author":"Vasko","year":"1984","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(02)00464-2_BIB20","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/nav.3800330207","article-title":"Hybrid heuristics for minimum cardinality set covering problems","volume":"33","author":"Vasko","year":"1986","journal-title":"Naval Research Logistics Quarterly"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004642?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004642?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T06:57:28Z","timestamp":1553929048000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702004642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0377221702004642"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00464-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}