Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
- 1 July 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 21 (3), 500-504
- https://doi.org/10.1145/321832.321847
Abstract
It is shown that the multisalesmen problem can be solved by solving the standard traveling salesman problem on an expanded graph. The expanded graph has m — 1 more nodes than the original graph where m is the number of salesmen available at the base.Keywords
This publication has 3 references indexed in Scilit:
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Traveling Salesman Problem: A SurveyOperations Research, 1968
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960