{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T14:39:54Z","timestamp":1776868794984,"version":"3.51.2"},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigaci\u00f3n","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100024370","name":"Ministero dell'Istruzione dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100024370","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011011","name":"Junta de Andaluc\u00eda","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011011","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.cor.2026.107479","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T19:53:35Z","timestamp":1776282815000},"page":"107479","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The covering tour problem with path upgrades"],"prefix":"10.1016","volume":"193","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0788-7412","authenticated-orcid":false,"given":"Marta","family":"Baldomero-Naranjo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5487-0181","authenticated-orcid":false,"given":"Andrea","family":"Mancuso","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8515-736X","authenticated-orcid":false,"given":"Adriano","family":"Masone","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1708-2108","authenticated-orcid":false,"given":"Antonio Manuel","family":"Rodr\u00edguez-Ch\u00eda","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cor.2026.107479_b1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10479-020-03561-4","article-title":"Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks","volume":"289","author":"Afrashteh","year":"2020","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2026.107479_b2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.cor.2017.01.014","article-title":"Lagrangian and branch-and-cut approaches for upgrading spanning tree problems","volume":"83","author":"\u00c1lvarez-Miranda","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107479_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2023.102894","article-title":"The discrete p-center location problem with upgrading","volume":"119","author":"Anton-Sanchez","year":"2023","journal-title":"Omega"},{"issue":"3","key":"10.1016\/j.cor.2026.107479_b4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s13675-015-0053-8","article-title":"Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem","volume":"5","author":"\u00c1vila","year":"2017","journal-title":"EURO J. Comput. Optim."},{"key":"10.1016\/j.cor.2026.107479_b5","series-title":"Decision Sciences","first-page":"143","article-title":"The covering tour problem with arc upgrades","author":"Baldomero-Naranjo","year":"2025"},{"issue":"1","key":"10.1016\/j.cor.2026.107479_b6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ejor.2022.02.001","article-title":"Upgrading edges in the maximal covering location problem","volume":"303","author":"Baldomero-Naranjo","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107479_b7","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1002\/net.22207","article-title":"On the complexity of the upgrading version of the maximal covering location problem","volume":"83","author":"Baldomero-Naranjo","year":"2024","journal-title":"Networks"},{"key":"10.1016\/j.cor.2026.107479_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107003","article-title":"Edge downgrades in the maximal covering location problem","volume":"178","author":"Baldomero-Naranjo","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107479_b9","series-title":"Datasets for the covering tour problem with path upgrades","author":"Baldomero-Naranjo","year":"2026"},{"issue":"2","key":"10.1016\/j.cor.2026.107479_b10","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/j.ejor.2017.11.063","article-title":"Solving the family traveling salesman problem","volume":"267","author":"Bernardino","year":"2018","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107479_b11","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1016\/j.ejor.2023.10.042","article-title":"The family capacitated vehicle routing problem","volume":"314","author":"Bernardino","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107479_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.trd.2021.102883","article-title":"Electric bike-sharing services mode substitution for driving, public transit, and cycling","volume":"96","author":"Bieli\u0144ski","year":"2021","journal-title":"Transp. Res. Part D: Transp. Environ."},{"key":"10.1016\/j.cor.2026.107479_b13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.cor.2018.10.007","article-title":"Upgrading nodes in tree-shaped hub location","volume":"102","author":"Blanco","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107479_b14","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.cor.2017.08.013","article-title":"Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm","volume":"89","author":"Boccia","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107479_b15","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/j.trc.2016.03.004","article-title":"Factors influencing the choice of shared bicycles and shared electric bikes in Beijing","volume":"67","author":"Campbell","year":"2016","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"10.1016\/j.cor.2026.107479_b16","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/s11750-019-00507-3","article-title":"A matheuristic for the distance-constrained close-enough arc routing problem","volume":"27","author":"Corber\u00e1n","year":"2019","journal-title":"TOP"},{"issue":"1","key":"10.1016\/j.cor.2026.107479_b17","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.ejor.2020.09.012","article-title":"On the distance-constrained close enough arc routing problem","volume":"291","author":"Corber\u00e1n","year":"2021","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107479_b18","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/trsc.23.3.208","article-title":"The covering salesman problem","volume":"23","author":"Current","year":"1989","journal-title":"Transp. Sci."},{"issue":"4","key":"10.1016\/j.cor.2026.107479_b19","doi-asserted-by":"crossref","first-page":"2123","DOI":"10.1111\/itor.13422","article-title":"The capacitated family traveling salesperson problem","volume":"31","author":"Dom\u00ednguez-Casasola","year":"2024","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.cor.2026.107479_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106354","article-title":"The p-median problem with upgrading of transportation costs and minimum travel time allocation","volume":"159","author":"Espejo","year":"2023","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107479_b21","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/opre.4.1.61","article-title":"The traveling-salesman problem","volume":"4","author":"Flood","year":"1956","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107479_b22","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.ejor.2008.09.013","article-title":"Up-and downgrading the 1-center in a network","volume":"198","author":"Gassner","year":"2009","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107479_b23","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.45.4.568","article-title":"The covering tour problem","volume":"45","author":"Gendreau","year":"1997","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107479_b24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2022.02.031","article-title":"Spatial coverage in routing and path planning problems","volume":"305","author":"Glock","year":"2023","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107479_b25","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1287\/ijoc.1110.0480","article-title":"The generalized covering salesman problem","volume":"24","author":"Golden","year":"2012","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.cor.2026.107479_b26","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0305-0548(99)00006-4","article-title":"Heuristics for the multi-vehicle covering tour problem","volume":"27","author":"Hachicha","year":"2000","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107479_b27","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.10039","article-title":"Shortest-path network interdiction","volume":"40","author":"Israeli","year":"2002","journal-title":"Networks"},{"key":"10.1016\/j.cor.2026.107479_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115894","article-title":"Scheduling the covering delivery problem in last mile delivery","volume":"187","author":"Jiang","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107479_b29","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s11590-021-01709-0","article-title":"A covering traveling salesman problem with profit in the last mile delivery","volume":"16","author":"Jiang","year":"2022","journal-title":"Optim. Lett."},{"issue":"3","key":"10.1016\/j.cor.2026.107479_b30","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1016\/j.ejor.2021.04.054","article-title":"Logistics planning of cash transfer to Syrian refugees in Turkey","volume":"296","author":"Kian","year":"2022","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107479_b31","doi-asserted-by":"crossref","DOI":"10.1016\/j.trb.2024.103034","article-title":"Uncapacitated single-allocation hub median location with edge upgrading: Models and exact solution algorithms","volume":"187","author":"Landete","year":"2024","journal-title":"Transp. Res. Part B: Methodol."},{"key":"10.1016\/j.cor.2026.107479_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106321","article-title":"Upgrading edges in the graphical TSP","volume":"159","author":"Landete","year":"2023","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107479_b33","first-page":"249","article-title":"Covering salesman problem with nodes and segments","volume":"7","author":"Matsuura","year":"2017","journal-title":"Am. J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107479_b34","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulation of traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"J. ACM"},{"key":"10.1016\/j.cor.2026.107479_b35","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110730","article-title":"Set covering routing problems: A review and classification scheme","volume":"198","author":"Moradi","year":"2024","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.cor.2026.107479_b36","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1111\/itor.12026","article-title":"Randomized heuristics for the family traveling salesperson problem","volume":"21","author":"Mor\u00e1n-Mirabal","year":"2014","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107479_b37","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1016\/j.ejor.2012.05.001","article-title":"A covering tour approach to the location of satellite distribution centers to supply humanitarian aid","volume":"222","author":"Naji-Azimi","year":"2012","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107479_b38","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2010.08.030","article-title":"Designing robust coverage networks to hedge against worst-case facility losses","volume":"209","author":"O\u2019Hanley","year":"2011","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107479_b39","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1590\/0101-7438.2015.035.03.0617","article-title":"Multi-vehicle covering tour problem: building routes for urban patrolling","volume":"35","author":"Oliveira","year":"2015","journal-title":"Pesquisa Operacional"},{"issue":"5","key":"10.1016\/j.cor.2026.107479_b40","doi-asserted-by":"crossref","first-page":"2930","DOI":"10.1111\/itor.13399","article-title":"A flow-based model for the multivehicle covering tour problem with route balancing","volume":"31","author":"Ota","year":"2024","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107479_b41","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10479-014-1587-5","article-title":"Up-and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams","volume":"246","author":"Plastria","year":"2016","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107479_b42","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.1016\/j.cor.2026.107479_b43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disopt.2018.02.002","article-title":"Upgrading the 1-center problem with edge length variables on a tree","volume":"29","author":"Sepasian","year":"2018","journal-title":"Discrete. Optim."},{"issue":"2","key":"10.1016\/j.cor.2026.107479_b44","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10852-014-9265-9","article-title":"Upgrading p-median problem on a path","volume":"14","author":"Sepasian","year":"2015","journal-title":"J. Math. Model. Algorithms Oper. Res."},{"key":"10.1016\/j.cor.2026.107479_b45","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.124176","article-title":"Heterogeneous teaching\u2013learning based optimization with local search for the covering delivering problem in last mile delivery","volume":"252","author":"Tao","year":"2024","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.cor.2026.107479_b46","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.ejor.2018.01.043","article-title":"A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands","volume":"268","author":"Veenstra","year":"2018","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107479_b47","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106263","article-title":"Covering delivery problem with electric vehicle and parcel lockers: Variable neighborhood search approach","volume":"157","author":"Vuki\u0107evi\u0107","year":"2023","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107479_b48","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/s10288-020-00461-y","article-title":"Mixed integer programming formulations for the generalized traveling salesman problem with time windows","volume":"19","author":"Yuan","year":"2021","journal-title":"4OR"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000973?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000973?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T13:49:00Z","timestamp":1776865740000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":48,"alternative-id":["S0305054826000973"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107479","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The covering tour problem with path upgrades","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107479","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107479"}}