The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
The Traveling Salesman and Related Stochastic Problems
[article]
1998
arXiv
pre-print
In the traveling salesman problem, one must find the length of the shortest closed tour visiting given "cities". We study the stochastic version of the problem, taking the locations of cities and the distances separating them to be random variables drawn from an ensemble. We consider first the ensemble where cities are placed in Euclidean space. We investigate how the optimum tour length scales with number of cities and with number of spatial dimensions. We then examine the analytical theory
arXiv:cond-mat/9803104v1
fatcat:5aplldbcozhczkm6dknxxivu4e