Mercedes Landete (Departamento de Estadística, Matemáticas e Informática, Universidad Miguel Hernández), Isaac Plana (Departamento de Matemáticas para la Economía y la Empresa, Universidad de Valencia), José Luis Sainz-Pardo (Departamento de Estadística, Matemáticas e Informática, Universidad Miguel Hernández) and José María Sanchis (Departamento de Matemática Aplicada, Universidad Politécnica de Valencia)


In this paper we present a generalization of the Graphical Traveling Salesman Problem (GTSP). Given a communication graph in which not all direct connections are necessarily possible, the Graphical Traveling Salesman Problem consists of finding the shortest tour that visits each node at least once. In this work, we assume the availability of a budget that allows to upgrade, i.e. reduce their traversal cost, some of the current connections and we propose the problem of designing the minimum cost tour using this budget. We propose and study a formulation for the problem, verifying that the polyhedron associated with the set of feasible solutions of a relaxed version of the problem is a full-dimensional polytope. We present families of valid inequalities that reinforce the model and pre-processing techniques to reduce the number of variables of the formulation. To solve the problem, we propose a branch-and-cut algorithm that uses the introduced valid inequalities, as well as a heuristic to obtain good upper bounds and a tailor-made branching strategy. Comprehensive computational experiments on a new set of benchmark instances are presented to assess the performance of this exact method.