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

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...

全面介紹

Saved in:
書目詳細資料
Main Authors: XU, Zhou, RODRIGUES, Brian Charles
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 2015
主題:
在線閱讀:https://ink.library.smu.edu.sg/lkcsb_research/4921
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!