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

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.

Bibliographic Details

Published in:	European journal of operational research 2005-05, Vol.162 (3), p.700-712
Main Authors:	Duchenne, Éric, Laporte, Gilbert, Semet, Frédéric
Format:	Article
Language:	English
Subjects:	Applied sciences Branch-and-cut Exact sciences and technology Flows in networks. Combinatorial problems Operational research and scientific management Operational research. Management science Operations research Peripatetic Salesman Problem Salespeople Studies Traveling Salesman Problem
Citations:	Items that this one cites Items that cite this one
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!