A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots

• Main Authors: XU, Zhou, RODRIGUES, Brian Charles
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2015
• Subjects: approximation algorithm; multiple depots; traveling salesman; matroid; Operations and Supply Chain Management
• Online Access: https://ink.library.smu.edu.sg/lkcsb_research/4921
• Institution: Singapore Management University

We study a natural extension of the classical traveling salesman problem (TSP) in the situation where multiple salesmen are dispatched from a number of different depots. As with the TSP, this problem is motivated by a large range of applications in vehicle routing. Although it is known to have a 2-a...