The m-Traveling Salesman Problem with Minmax Objective
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 …
Problem in which the objective is to minimize the length of the longest route. A tabu search …
The m-Traveling Salesman Problem with Minmax Objective
PM FRANÇA, M GENDREAU, G LAPORTE… - Transportation …, 1995 - JSTOR
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 …
Problem in which the objective is to minimize the length of the longest route. A tabu search …
[PDF][PDF] The m-Traveling Salesman Problem with Minmax Objective
PM FRANÇA - Transportation Science, 1995 - researchgate.net
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 …
Problem in which the objective is to minimize the length of the longest route. A tabu search …
[PDF][PDF] The m-Traveling Salesman Problem with Minmax Objective
PM FRANÇA - Transportation Science, 1995 - academia.edu
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 …
Problem in which the objective is to minimize the length of the longest route. A tabu search …
[引用][C] THE M-TRAVELING SALESMAN PROBLEM WITH MINMAX OBJECTIVE
PM FRANCA, M Gendreau, G Laporte… - … DE RECHERCHE SUR …, 1992 - trid.trb.org
This article considers the minmax version of the m-Traveling Salesman Problem in which the
objective is to minimize the length of the longest route. Tabu search heuristics and exact …
objective is to minimize the length of the longest route. Tabu search heuristics and exact …
The m-Traveling Salesman Problem with Minmax Objective
PM França, M Gendreau, G Laporte… - Transportation …, 1995 - ideas.repec.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 …
Problem in which the objective is to minimize the length of the longest route. A tabu search …
The m-Traveling Salesman Problem with Minmax Objective
PM França, M Gendreau, G Laporte, FM Müller - Transportation Science, 1995 - cir.nii.ac.jp
抄録< jats: p> 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 …
Salesman Problem in which the objective is to minimize the length of the longest route. A …
[引用][C] The m-Traveling Salesman Problem with Minmax objective
PM FRANCA, M GRENDREAU… - Transportation …, 1995 - pascal-francis.inist.fr
The m-Traveling Salesman Problem with Minmax objective CNRS Inist Pascal-Francis CNRS
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
The m-Traveling Salesman Problem with Minmax Objective.
PM França, M Gendreau… - Transportation Science, 1995 - search.ebscohost.com
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 …
Problem in which the objective is to minimize the length of the longest route. A tabu search …
The m-Traveling Salesman Problem with Minmax Objective
PM França, M Gendreau, G Laporte… - Transportation …, 1995 - econpapers.repec.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 …
Problem in which the objective is to minimize the length of the longest route. A tabu search …