We have developed the following approximation algorithms for several variants of the Multiple TSP and Multiple Hamiltonian Path Problem (HPP):
Journal Publications:
J. Bae and S. Rathinam, Approximation algorithms for multiple terminal, Hamiltonian path problems, Optimization Letters, Accepted (in print), October, 2010. DOI: 10.1007/s11590-010-0252-4. (pdf)
S. Rathinam and R. Sengupta. 3/2-Approximation Algorithm for variants of a 2-Depot, Hamiltonian Path Problem. Operations Research Letters, 38 (2010), pp. 63-68. (pdf)
W. Malik, S. Rathinam, and D. Swaroop. A 2-Approximation Algorithm for a Generalized, Multiple Depot Traveling Salesman Problem. Operations Research Letters, Volume 35, Issue 6, November 2007, Pages 747-753. (pdf)
Conference Publications:
S. Rathinam and R. Sengupta. Lower and Upper bounds for a Multiple Depot Routing Problem. IEEE Conference on Decision and Control, December 2006, San Diego.