Duchenne, Éric; Laporte, Gilbert; Semet, Frédéric - In: European Journal of Operational Research 223 (2012) 3, pp. 637-643
In the m-Capacitated Peripatetic Salesman Problem (m-CPSP) the aim is to determine m Hamiltonian cycles of minimal total cost on a graph, such that all the edges are traversed less than the value of their capacity. This article introduces three formulations for the m-CPSP. Two branch-and-cut...