This article proposes algorithms for the Minmax version of the m-Traveling Salesman Problem in which the objective is to minimize the length of the longest route. A tabu search heuristic and two exact search schemes are developed. Problems involving up to 50 vertices are solved to optimality.
No takes yet. Share an insight, caveat, or question.
França et al. (1995) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: