The m-Traveling Salesman Problem with Minmax Objective
研究了多旅行商问题的最小化最大路径长度版本，提出了禁忌搜索启发式和两种精确搜索方案，可求解最多50个顶点的最优解。
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.