Branch-and-cut algorithms for the covering salesman problem

Lucas Porto Maziero, Fábio Luiz Usberti, Celso Cavellucci

The Covering Salesman Problem (CSP) is a generalization of the Traveling Salesman Problem in which the tour is not required to visit all vertices, as long as all vertices are cover…