The m-Traveling Salesman Problem with Minmax Objective
Transportation Science, 1995•pubsonline.informs.org
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.
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.
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.
INFORMS以上显示的是最相近的搜索结果。 查看全部搜索结果