1 paper · 1 filter
A. G. Percus
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 locati…