Article ID Journal Published Year Pages File Type
9663926 European Journal of Operational Research 2005 13 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
Authors
, , ,