Groupe d’études et de recherche en analyse des décisions

G-2003-02

Branch-and-Cut Algorithms for the Undirected m-Peripatetic Salesman Problem

, et

In the m-Peripatetic Salesman Problem (m-PSP) the aim is to determine m edge disjoint Hamiltonian cycles of minimum total cost on a graph. This article describes exact branch-and-cut solution procedures for the undirected m-PSP. Computational results are reported on random and Euclidean graphs.

, 21 pages

Ce cahier a été révisé en septembre 2003