The m-Traveling Salesman Problem with Minmax Objective
Published Online:1 Aug 1995https://doi.org/10.1287/trsc.29.3.267
Abstract
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.
