Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem

Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem

0.00 Avg rating—0 Votes
Article ID: iaor2006379
Country: Netherlands
Volume: 162
Issue: 3
Start Page Number: 700
End Page Number: 712
Publication Date: May 2005
Journal: European Journal of Operational Research
Authors: , ,
Keywords: programming: branch and bound, programming: integer
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.

Reviews

Required fields are marked *. Your email address will not be published.