{"id":"https://openalex.org/W4415601613","doi":"https://doi.org/10.1016/j.cor.2026.107479","title":"The Covering Tour Problem with Path Upgrades","display_name":"The Covering Tour Problem with Path Upgrades","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415601613","doi":"https://doi.org/10.1016/j.cor.2026.107479"},"language":"en","primary_location":{"id":"doi:10.1016/j.cor.2026.107479","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107479","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.cor.2026.107479","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075415451","display_name":"Marta Baldomero\u2010Naranjo","orcid":"https://orcid.org/0000-0002-0788-7412"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marta Baldomero-Naranjo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073714294","display_name":"Andrea Mancuso","orcid":"https://orcid.org/0000-0001-5487-0181"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Andrea Mancuso","raw_affiliation_strings":["University of Naples Federico II"],"affiliations":[{"raw_affiliation_string":"University of Naples Federico II","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091226524","display_name":"Adriano Masone","orcid":"https://orcid.org/0000-0002-8515-736X"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Adriano Masone","raw_affiliation_strings":["University of Naples Federico II"],"affiliations":[{"raw_affiliation_string":"University of Naples Federico II","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011134234","display_name":"Antonio M. Rodr\u00edguez\u2010Ch\u00eda","orcid":"https://orcid.org/0000-0002-1708-2108"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Antonio Manuel Rodr\u00edguez-Ch\u00eda","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075415451"],"corresponding_institution_ids":[],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":{"value":3210,"currency":"USD","value_usd":3210},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.4240535,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"193","issue":null,"first_page":"107479","last_page":"107479"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.838100016117096,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.838100016117096,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.08079999685287476,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.03240000084042549,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5942999720573425},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5383999943733215},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4848000109195709},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43779999017715454},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.41499999165534973},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.3849000036716461},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3463999927043915}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6452999711036682},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6061000227928162},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5942999720573425},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5383999943733215},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4848000109195709},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43779999017715454},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.41499999165534973},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3849000036716461},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3711000084877014},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.33390000462532043},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.31040000915527344},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.25859999656677246},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.25600001215934753},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2531999945640564}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.cor.2026.107479","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107479","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},{"id":"doi:10.2139/ssrn.5669879","is_oa":true,"landing_page_url":"https://doi.org/10.2139/ssrn.5669879","pdf_url":null,"source":{"id":"https://openalex.org/S4210172589","display_name":"SSRN Electronic Journal","issn_l":"1556-5068","issn":["1556-5068"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1318003438","host_organization_name":"RELX Group (Netherlands)","host_organization_lineage":["https://openalex.org/I1318003438"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"}],"best_oa_location":{"id":"doi:10.1016/j.cor.2026.107479","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107479","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320326754","display_name":"Junta de Andaluc\u00eda","ror":"https://ror.org/01jem9c82"},{"id":"https://openalex.org/F4320335598","display_name":"Agencia Estatal de Investigaci\u00f3n","ror":null},{"id":"https://openalex.org/F5497039910","display_name":"Ministero dell'Istruzione e del Merito","ror":"https://ror.org/01ehyh486"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1966175066","https://openalex.org/W1994863634","https://openalex.org/W1998699120","https://openalex.org/W2035178080","https://openalex.org/W2049287714","https://openalex.org/W2080160510","https://openalex.org/W2087858211","https://openalex.org/W2099011086","https://openalex.org/W2110856202","https://openalex.org/W2134531991","https://openalex.org/W2163428398","https://openalex.org/W2212020139","https://openalex.org/W2227559896","https://openalex.org/W2302781442","https://openalex.org/W2585703503","https://openalex.org/W2738573011","https://openalex.org/W2750190423","https://openalex.org/W2786927475","https://openalex.org/W2795933202","https://openalex.org/W2920904606","https://openalex.org/W2963527389","https://openalex.org/W3010912433","https://openalex.org/W3087264509","https://openalex.org/W3136451821","https://openalex.org/W3159405697","https://openalex.org/W3200276418","https://openalex.org/W4210801032","https://openalex.org/W4213235338","https://openalex.org/W4367856854","https://openalex.org/W4381549164","https://openalex.org/W4388459164","https://openalex.org/W4390946338","https://openalex.org/W4401123168","https://openalex.org/W4407252956"],"related_works":[],"abstract_inverted_index":{"This":[0,90],"work":[1],"introduces":[2],"the":[3,23,39,44,47,67,118,152,186,190,193,203,207],"Covering":[4,41],"Tour":[5,42],"Problem":[6],"with":[7,20,156],"Path":[8],"Upgrades":[9],"(CTP-PU)":[10],"where":[11,110],"for":[12,132,173],"a":[13,17,28,52,70,93,129,167],"given":[14],"graph":[15],"and":[16,96,106,147,201,210,216],"cost":[18],"associated":[19],"each":[21,81],"arc,":[22],"objective":[24],"is":[25],"to":[26,66,86,143,188],"find":[27],"minimum-cost":[29],"tour":[30],"that":[31],"ensures":[32],"coverage":[33,85],"of":[34,49,75,140,154,160,166,176,192,206],"all":[35],"non-tours":[36],"nodes.":[37,89],"Unlike":[38],"classical":[40],"Problem,":[43],"CTP-PU":[45],"enables":[46],"upgrading":[48],"arcs":[50,56],"within":[51],"budget.":[53],"These":[54],"upgraded":[55],"can":[57,78],"be":[58],"shared":[59,112],"by":[60],"multiple":[61],"paths":[62],"from":[63,80,185],"non-tour":[64],"nodes":[65,77],"tour.":[68],"As":[69],"result,":[71],"more":[72,94],"than":[73],"one":[74],"these":[76,145],"benefit":[79],"upgrade,":[82],"thereby":[83],"extending":[84],"previously":[87],"unreachable":[88],"approach":[91],"provides":[92],"practical":[95],"cost-effective":[97],"solution,":[98],"particularly":[99],"beneficial":[100],"in":[101],"scenarios":[102],"like":[103],"humanitarian":[104],"aid":[105],"medical":[107],"supply":[108],"distribution":[109],"optimizing":[111],"infrastructure":[113],"enhances":[114],"overall":[115],"efficiency.To":[116],"address":[117],"CTP-PU,":[119],"we":[120,162],"propose":[121],"several":[122],"Mixed-Integer":[123],"Linear":[124],"Programming":[125],"formulations":[126,146,155],"based":[127],"on":[128,213],"different":[130,138],"rationale":[131],"preventing":[133],"subtours.":[134],"We":[135],"also":[136],"introduce":[137],"families":[139],"valid":[141,208],"inequalities":[142,209],"tighten":[144],"improve":[148],"computational":[149,180,217],"efficiency.":[150],"In":[151],"case":[153],"an":[157],"exponential":[158],"number":[159],"constraints,":[161],"develop":[163],"alternative":[164],"variants":[165],"Branch-and-Cut":[168],"(B&C)":[169],"procedure":[170,212],"specifically":[171],"designed":[172],"this":[174],"type":[175],"problem.We":[177],"perform":[178],"extensive":[179],"experiments":[181],"using":[182],"benchmark":[183],"instances":[184],"literature":[187],"evaluate":[189],"effectiveness":[191],"proposed":[194],"method.":[195],"Our":[196],"results":[197],"demonstrate":[198],"their":[199],"efficiency":[200],"highlight":[202],"significant":[204],"impact":[205],"B&C":[211],"solution":[214],"quality":[215],"time.":[218]},"counts_by_year":[],"updated_date":"2026-04-23T09:07:50.710637","created_date":"2025-10-28T00:00:00"}