An Analysis of the Extended Christofides Heuristic for the k-depot Travelling Salesman Problem
We study an extension of the classical traveling salesman problem (TSP) to a situation with k≥2 depots at each of which a distinct salesman is based. We show that a non-trivial extension of the well-known Christofides heuristic has a tight approximation ratio of 2−1/k, which improves on the known 2-approximation algorithm from the literature.
Approximation algorithms, Christofides heuristic, Multiple depots, TSP
Operations and Supply Chain Management
Operations Research Letters
XU, Zhou; XU, Liang; and RODRIGUES, Brian Charles.
An Analysis of the Extended Christofides Heuristic for the k-depot Travelling Salesman Problem. (2011). Operations Research Letters. 39, (3), 218-223. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/4920
This document is currently not available here.