TY  - GEN 
AU  - Baldomero Naranjo, Marta
AU  - Mancuso, A.
AU  - Masone, A.
AU  - Rodríguez Chía, Antonio Manuel
A4  - Estadística e Investigación Operativa
PY  - 2026
SN  - 1873-765X
SN  - 0305-0548
UR  - http://hdl.handle.net/10498/40569
AB  - This work introduces the Covering Tour Problem with Path Upgrades (CTP-PU) where for a given graph and a cost associated with each arc, the objective is to find a minimum-cost tour that ensures coverage of all non-tour nodes. Unlike the classical...
LA  - eng
PB  - Elsevier Ltd
KW  - Covering tour problem
KW  - Mixed-integer linear programming
KW  - Routing
KW  - Upgrading
TI  - The covering tour problem with path upgrades
DO  - 10.1016/J.COR.2026.107479
ER  -