Technical Note—A Note on the Multiple Traveling Salesmen Problem

M. R. Rao
Additional contact information
M. R. Rao: New York University, New York, New York, and Indian Institute of Management, Bangalore, India

Operations Research, 1980, vol. 28, issue 3-part-i, 628-632

Abstract: The fixed charge symmetric multiple traveling salesmen problem with n cities and m salesmen is transformed to a standard symmetric traveling salesman problem with n + m − 1 cities. The asymmetric problem with m = 2 and a different base city for each salesman is also transformed to a standard asymmetric traveling salesman problem.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.3.628 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:28:y:1980:i:3-part-i:p:628-632

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().