The Traveling-Salesman Problem
 |
 |
 |
abstract = {The traveling-salesman problem is that of finding a permutation $P = (1\,i_2\,i_3 \cdots i_n)$ of the integers from 1 through $n$ that minimizes the quantity $a_{1i_2} + a_{i_2i_3} + a_{i_3i_4} + \cdots + a_{i_n1}$, where the $a_{\alpha\beta}$ 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 permutation.
This problem was posed, in 1934, by Hassler Whitney in a seminar talk at Princeton University. There are as yet no acceptable computational methods, and surprisingly few mathematical results relative to the problem.},
apice = {TspIor4},
author = {Merrill M. Flood},
doi = {10.1287/opre.4.1.61},
eissn = {1526-5463},
issn = {0030-364X},
journal = {Operations Research},
month = feb,
number = 1,
numpages = 15,
openalex = {W1994863634},
pages = {61--75},
publisher = {INFORMS},
title = {The Traveling-Salesman Problem},
url = {https://pubsonline.informs.org/doi/10.1287/opre.4.1.61},
volume = 4,
year = 1956
}
