Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/78167
Type: Artigo de periódico
Title: THE M-TRAVELING SALESMAN PROBLEM WITH MINMAX OBJECTIVE
Author: FRANCA, PM
GENDREAU, M
LAPORTE, G
MULLER, FM
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.
Editor: Operations Res Soc Amer
Rights: aberto
Identifier DOI: 10.1287/trsc.29.3.267
Date Issue: 1995
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.