{"id":"https://openalex.org/W3047376362","doi":"https://doi.org/10.1007/s13675-020-00131-y","title":"The complete vertex p-center problem","display_name":"The complete vertex p-center problem","publication_year":2020,"publication_date":"2020-08-05","ids":{"openalex":"https://openalex.org/W3047376362","doi":"https://doi.org/10.1007/s13675-020-00131-y","mag":"3047376362"},"language":"en","primary_location":{"id":"doi:10.1007/s13675-020-00131-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-020-00131-y","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1007/s13675-020-00131-y","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"F.Antonio Medrano","orcid":"https://orcid.org/0000-0002-5913-632X"},"institutions":[{"id":"https://openalex.org/I96749437","display_name":"Texas A&M University \u2013 Corpus Christi","ror":"https://ror.org/01mrfdz82","country_code":"US","type":"education","lineage":["https://openalex.org/I96749437"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"F.Antonio Medrano","raw_affiliation_strings":["Conrad Blucher Institute for Surveying and Science, Department of Computing Sciences, Texas A&M University\u2013Corpus Christi, 6300 Ocean Drive, Unit 5799, Corpus Christi, TX, USA"],"raw_orcid":"https://orcid.org/0000-0002-5913-632X","affiliations":[{"raw_affiliation_string":"Conrad Blucher Institute for Surveying and Science, Department of Computing Sciences, Texas A&M University\u2013Corpus Christi, 6300 Ocean Drive, Unit 5799, Corpus Christi, TX, USA","institution_ids":["https://openalex.org/I96749437"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I96749437"],"apc_list":{"value":1400,"currency":"USD","value_usd":1400},"apc_paid":{"value":1400,"currency":"USD","value_usd":1400},"fwci":0.4361,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.72580733,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"3-4","first_page":"327","last_page":"343"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7020999789237976},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.5264000296592712},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5228000283241272},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.484499990940094},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.43619999289512634},{"id":"https://openalex.org/keywords/trimming","display_name":"Trimming","score":0.4016000032424927},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.3880999982357025},{"id":"https://openalex.org/keywords/1-center-problem","display_name":"1-center problem","score":0.3813000023365021}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7020999789237976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5964000225067139},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.5264000296592712},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5228000283241272},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48899999260902405},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.484499990940094},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.43619999289512634},{"id":"https://openalex.org/C56951928","wikidata":"https://www.wikidata.org/wiki/Q3539213","display_name":"Trimming","level":2,"score":0.4016000032424927},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.3880999982357025},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3846000134944916},{"id":"https://openalex.org/C50524431","wikidata":"https://www.wikidata.org/wiki/Q4545814","display_name":"1-center problem","level":3,"score":0.3813000023365021},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38119998574256897},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.3653999865055084},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.3546999990940094},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.34860000014305115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3481999933719635},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3025999963283539},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.2840000092983246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2818000018596649},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.275299996137619}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s13675-020-00131-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-020-00131-y","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2109.12723","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2109.12723","pdf_url":"https://arxiv.org/pdf/2109.12723","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:RePEc:spr:eurjco:v:8:y:2020:i:3:d:10.1007_s13675-020-00131-y","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s13675-020-00131-y","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:doaj.org/article:d4d62cbe3b094d379bcac9cb3e7f77d5","is_oa":true,"landing_page_url":"https://doaj.org/article/d4d62cbe3b094d379bcac9cb3e7f77d5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"EURO Journal on Computational Optimization, Vol 8, Iss 3, Pp 327-343 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s13675-020-00131-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-020-00131-y","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W807504450","https://openalex.org/W1156678223","https://openalex.org/W1965849340","https://openalex.org/W1978497904","https://openalex.org/W1981991106","https://openalex.org/W1983578044","https://openalex.org/W1986707850","https://openalex.org/W1991905748","https://openalex.org/W1992428442","https://openalex.org/W2008706951","https://openalex.org/W2014200946","https://openalex.org/W2028318528","https://openalex.org/W2030994722","https://openalex.org/W2042361754","https://openalex.org/W2072803333","https://openalex.org/W2073697327","https://openalex.org/W2087506575","https://openalex.org/W2089727601","https://openalex.org/W2094078700","https://openalex.org/W2097245136","https://openalex.org/W2102750402","https://openalex.org/W2122448542","https://openalex.org/W2122578138","https://openalex.org/W2128751223","https://openalex.org/W2154989541","https://openalex.org/W2163428398","https://openalex.org/W2401628776","https://openalex.org/W2482449879","https://openalex.org/W2555017693","https://openalex.org/W2604493856","https://openalex.org/W2889430680","https://openalex.org/W2901909299","https://openalex.org/W4234918470","https://openalex.org/W4238107244","https://openalex.org/W4239852074","https://openalex.org/W4251837308","https://openalex.org/W6629999201"],"related_works":[],"abstract_inverted_index":{"The":[0,31],"vertex":[1,33],"p-center":[2,34,38,111],"problem":[3,35,39,130,136,157],"consists":[4],"of":[5,12,49,60,88,99,178],"locating":[6],"p":[7,42],"facilities":[8,61],"among":[9],"a":[10,53,74,132],"set":[11,134,169],"M":[13],"potential":[14],"sites":[15],"such":[16],"that":[17],"the":[18,37,46,58,63,86,95,100,109,115,126,129,143,156,168],"maximum":[19],"distance":[20,65,144],"from":[21,43],"any":[22],"demand":[23],"to":[24,45,67,76,83,131,154],"its":[25],"closest":[26],"located":[27],"facility":[28],"is":[29],"minimized.":[30],"complete":[32,110],"solves":[36],"for":[40,94,107,139],"all":[41,140],"1":[44],"total":[47],"number":[48,59],"sites,":[50],"resulting":[51],"in":[52,142,164],"multi-objective":[54],"trade-off":[55,72],"curve":[56],"between":[57],"and":[62,78,125,137],"service":[64],"required":[66],"achieve":[68],"full":[69],"coverage.":[70],"This":[71],"provides":[73],"reference":[75],"planners":[77],"decision":[79],"makers,":[80],"enabling":[81],"them":[82],"easily":[84],"visualize":[85],"consequences":[87],"choosing":[89],"different":[90],"coverage":[91],"design":[92],"criteria":[93],"given":[96],"spatial":[97],"configuration":[98],"problem.":[101],"We":[102,146],"present":[103],"two":[104],"fast":[105],"algorithms":[106],"solving":[108,138],"problem:":[112],"one":[113],"using":[114],"classical":[116],"formulation":[117],"but":[118],"trimming":[119],"variables":[120],"while":[121],"still":[122],"maintaining":[123],"optimality":[124],"other":[127],"converting":[128],"location":[133],"covering":[135,170],"distances":[141],"matrix.":[145],"also":[147],"discuss":[148],"scenarios":[149],"where":[150],"it":[151],"makes":[152],"sense":[153],"solve":[155],"via":[158],"brute-force":[159],"enumeration.":[160],"All":[161],"methods":[162],"result":[163],"significant":[165],"speedups,":[166],"with":[167],"method":[171],"reducing":[172],"computation":[173],"times":[174],"by":[175],"many":[176],"orders":[177],"magnitude.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2020-08-10T00:00:00"}