Reduction Rules for the Covering Tour Problem

The Covering Tour Problem (CTP) is a generalization of the Traveling Salesman Problem (TSP) which has several actual applications. It is denned on an undirected graph G = (V ∪ W, E), where W is a set of vertices that must be covered. The problem consists of determining a minimum length Hamiltonian cycle on a subset of V such that every vertex of W is within a given distance d from, at least, one node in the cycle. This work proposes reduction rules to a generalization of the CTP and also a new Integer Linear Program formulation.