The covering tour problem with path upgrades

DOI10.1016/J.COR.2026.107479MaRDI QIDQ7285937zbMATH OpenFDO

Authors Marta Baldomero-Naranjo, A. Mancuso, Adriano Masone, Antonio M. Rodríguez-Chía

Publication date 22 June 2026

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2026.107479

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A covering traveling salesman problem with profit in the last mile delivery
• A flow-based model for the multivehicle covering tour problem with route balancing
• A matheuristic for the distance-constrained close-enough arc routing problem
• A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands
• Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach
• Designing robust coverage networks to hedge against worst-case facility losses
• Edge downgrades in the maximal covering location problem
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• Heuristics for the multi-vehicle covering tour problem
• Integer Programming Formulation of Traveling Salesman Problems
• Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
• Logistics planning of cash transfer to Syrian refugees in Turkey
• Mixed integer programming formulations for the generalized traveling salesman problem with time windows
• Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm
• On the complexity of the upgrading version of the maximal covering location problem
• On the distance-constrained close enough arc routing problem
• Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks
• Shortest-path network interdiction
• Spatial coverage in routing and path planning problems
• The p-median problem with upgrading of transportation costs and minimum travel time allocation
• The capacitated family traveling salesperson problem
• The Covering Salesman Problem
• The Covering Tour Problem
• The family capacitated vehicle routing problem
• The generalized covering salesman problem
• The traveling-salesman problem
• TSPLIB—A Traveling Salesman Problem Library
• Up- and downgrading the 1-center in a network
• Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
• Upgrading \(p\)-median problem on a path
• Upgrading edges in the graphical TSP
• Upgrading edges in the maximal covering location problem
• Upgrading nodes in tree-shaped hub location
• Upgrading the 1-center problem with edge length variables on a tree

This page was built for publication: The covering tour problem with path upgrades

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285937)