{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:45Z","timestamp":1774421325519,"version":"3.50.1"},"reference-count":41,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s13675-020-00131-y","type":"journal-article","created":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T05:03:01Z","timestamp":1596603781000},"page":"327-343","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["The complete vertex p-center problem"],"prefix":"10.1016","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5913-632X","authenticated-orcid":false,"given":"F.Antonio","family":"Medrano","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-020-00131-y_CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","article-title":"Integer programming: methods, uses, computations","volume":"12","author":"Balinski","year":"1965","journal-title":"Manag Sci"},{"key":"10.1007\/s13675-020-00131-y_CR2","doi-asserted-by":"crossref","first-page":"2991","DOI":"10.1016\/j.cor.2013.07.011","article-title":"Double bound method for solving the p-center location problem","volume":"40","author":"Calik","year":"2013","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-020-00131-y_CR3","series-title":"Location science","first-page":"79","article-title":"p-Center problems","author":"Calik","year":"2015"},{"key":"10.1007\/s13675-020-00131-y_CR4","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1016\/j.cor.2008.03.009","article-title":"New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems","volume":"36","author":"Chen","year":"2009","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-020-00131-y_CR5","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.cor.2006.03.006","article-title":"BEAMR: an exact and approximate model for the p-median problem","volume":"35","author":"Church","year":"2008","journal-title":"Comput Oper Res"},{"issue":"3","key":"10.1007\/s13675-020-00131-y_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1177\/0160017616650612","article-title":"Tobler\u2019s law and spatial optimization why bakersfield?","volume":"41","author":"Church","year":"2016","journal-title":"Int Reg Sci Rev"},{"key":"10.1007\/s13675-020-00131-y_CR7","first-page":"277","article-title":"The multi-level location set covering model","volume":"35","author":"Church","year":"2003","journal-title":"Geogr Anal"},{"key":"10.1007\/s13675-020-00131-y_CR8","article-title":"AM-46-location-allocation modeling","author":"Church","year":"2018","journal-title":"Geogr Inf Sci Technol Body Knowl"},{"key":"10.1007\/s13675-020-00131-y_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1111\/j.1435-5597.1974.tb00902.x","article-title":"The maximal covering location problem","volume":"32","author":"Church","year":"1974","journal-title":"Pap Reg Sci"},{"key":"10.1007\/s13675-020-00131-y_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1111\/j.1435-5597.1983.tb00807.x","article-title":"Generalized coverage models and public facility location","volume":"53","author":"Church","year":"1983","journal-title":"Pap Reg Sci Assoc"},{"key":"10.1007\/s13675-020-00131-y_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02034236","article-title":"Theoretical links between median and coverage location problems","volume":"6","author":"Church","year":"1986","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13675-020-00131-y_CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.cor.2018.11.006","article-title":"A scalable exact algorithm for the vertex p-center problem","volume":"103","author":"Contardo","year":"2019","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-020-00131-y_CR13","doi-asserted-by":"crossref","unstructured":"Daskin MS (2013) Center problems. In: Network and discrete location: models, algorithms, and applications. 2nd edn. Wiley, New York, pp 193\u2013234. https:\/\/doi.org\/10.1002\/9781118537015.ch05","DOI":"10.1002\/9781118537015.ch05"},{"key":"10.1007\/s13675-020-00131-y_CR14","doi-asserted-by":"crossref","unstructured":"Daskin MS, Maass KL (2015) The p-median problem. In: Location science. Springer, Berlin, pp 21\u201345","DOI":"10.1007\/978-3-319-13111-5_2"},{"key":"10.1007\/s13675-020-00131-y_CR15","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1111\/j.1538-4632.1999.tb00979.x","article-title":"Two new location covering problems: the partial p-center problem and the partial set covering problem","volume":"31","author":"Daskin","year":"1999","journal-title":"Geogr Anal"},{"key":"10.1007\/s13675-020-00131-y_CR16","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.18.4.351","article-title":"The planar two-center and two-median problems","volume":"18","author":"Drezner","year":"1984","journal-title":"Transp Sci"},{"key":"10.1007\/s13675-020-00131-y_CR17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/s12597-012-0098-x","article-title":"An effective heuristic for the p-median problem with application to ambulance location","volume":"50","author":"Dzator","year":"2013","journal-title":"Opsearch"},{"key":"10.1007\/s13675-020-00131-y_CR18","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/ijoc.1030.0028","article-title":"A new formulation and resolution method for the p-center problem","volume":"16","author":"Elloumi","year":"2004","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-020-00131-y_CR19","first-page":"37","article-title":"Optimization models in the location of healthcare facilities: a real case in Brazil","volume":"4","author":"Fo","year":"2012","journal-title":"J Appl Oper Res"},{"key":"10.1007\/s13675-020-00131-y_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13675-017-0084-4","article-title":"An improved cut-and-solve algorithm for the single-source capacitated facility location problem","volume":"6","author":"Gadegaard","year":"2018","journal-title":"EURO J Comput Optim"},{"key":"10.1007\/s13675-020-00131-y_CR21","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1287\/ijoc.1100.0418","article-title":"Solving large p-median problems with a radius formulation","volume":"23","author":"Garc\u00eda","year":"2011","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-020-00131-y_CR22","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimum locations of switching centers and the absolute centers and medians of a graph","volume":"12","author":"Hakimi","year":"1964","journal-title":"Oper Res"},{"key":"10.1007\/s13675-020-00131-y_CR23","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 J Appl Math"},{"key":"10.1007\/s13675-020-00131-y_CR24","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-1-4612-5355-6_11","article-title":"Siting emergency services","volume":"1","author":"Marianov","year":"1995","journal-title":"Facil Locat Surv Appl Methods"},{"key":"10.1007\/s13675-020-00131-y_CR25","unstructured":"Medrano FA (2019) p-center. https:\/\/github.com\/antoniomedrano\/p-center. Accessed 25 Sept 2019"},{"key":"10.1007\/s13675-020-00131-y_CR26","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 Rev"},{"key":"10.1007\/s13675-020-00131-y_CR27","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/net.10081","article-title":"Solving the p-center problem with tabu search and variable neighborhood search","volume":"42","author":"Mladenovi\u0107","year":"2003","journal-title":"Networks"},{"key":"10.1007\/s13675-020-00131-y_CR28","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1016\/j.ejor.2015.06.054","article-title":"The disruptive anti-covering location problem","volume":"247","author":"Niblett","year":"2015","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-020-00131-y_CR29","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB\u2014a traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J Comput"},{"key":"10.1007\/s13675-020-00131-y_CR30","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0377-2217(93)90329-L","article-title":"Facility siting and integer-friendly programming","volume":"65","author":"ReVelle","year":"1993","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-020-00131-y_CR31","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1057\/jors.1979.192","article-title":"The p-median and its linear programming relaxation: an approach to large problems","volume":"30","author":"Rosing","year":"1979","journal-title":"J Oper Res Soc"},{"key":"10.1007\/s13675-020-00131-y_CR32","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10732-011-9160-8","article-title":"GRASP strategies for a bi-objective commercial territory design problem","volume":"19","author":"Salazar-Aguilar","year":"2013","journal-title":"J Heuristics"},{"key":"10.1007\/s13675-020-00131-y_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1540-5915.1982.tb00126.x","article-title":"Strategic facility planning: the analysis of options","volume":"13","author":"Schilling","year":"1982","journal-title":"Decis Sci"},{"key":"10.1007\/s13675-020-00131-y_CR34","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/trsc.11.3.243","article-title":"A min-max theorem for p-center problems on a tree","volume":"11","author":"Shier","year":"1977","journal-title":"Transp Sci"},{"key":"10.1007\/s13675-020-00131-y_CR35","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1080\/07408170500469113","article-title":"Stochastic p-robust location problems","volume":"38","author":"Snyder","year":"2006","journal-title":"IIE Trans"},{"key":"10.1007\/s13675-020-00131-y_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0305-0548(91)90037-R","article-title":"Generating the noninferior set in mixed integer biobjective linear programs: an application to a location problem","volume":"18","author":"Solanki","year":"1991","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-020-00131-y_CR37","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0966-8349(96)00012-5","article-title":"The p-center location problem in an area","volume":"4","author":"Suzuki","year":"1996","journal-title":"Locat Sci"},{"key":"10.1007\/s13675-020-00131-y_CR38","unstructured":"Swain RW (1971) A decomposition algorithm for a class of facility location problems. (No. 71-24530 UMI)"},{"issue":"5","key":"10.1007\/s13675-020-00131-y_CR39","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","article-title":"Heuristic methods for estimating the generalized vertex median of a weighted graph","volume":"16","author":"Teitz","year":"1968","journal-title":"Oper Res"},{"key":"10.1007\/s13675-020-00131-y_CR40","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.cor.2018.08.009","article-title":"Effective methods for solving the Bi-criteria p-Center and p-Dispersion problem","volume":"101","author":"Tutunchi","year":"2019","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-020-00131-y_CR41","unstructured":"Wei H (2008) Solving continuous space location problems. Dissertation, The Ohio State University"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-020-00131-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-020-00131-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001337?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001337?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-020-00131-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:47:59Z","timestamp":1761882479000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621001337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":41,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["S2192440621001337"],"URL":"https:\/\/doi.org\/10.1007\/s13675-020-00131-y","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2020,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The complete vertex p-center problem","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-020-00131-y","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2020 The Author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}