Results 171 to 180 of about 59,482 (207)
Some of the next articles are maybe not open access.
The Traveling-Salesman Problem
Operations Research, 1956The traveling-salesman problem is that of finding a permutation P = (1 i2 i3 … in) of the integers from 1 through n that minimizes the quantity [Formula: see text] where the aαβ are a given set of real numbers. More accurately, since there are only (n − 1)′ possibilities to consider, the problem is to find an efficient method for choosing a minimizing
openaire +1 more source
The multiple traveling salesman problem: an overview of formulations and solution procedures
Omega, 2006Tolga Bektas
exaly