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.
No takes yet. Share an insight, caveat, or question.
Bellmore et al. (1974) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: