The Noisy Euclidean Traveling Salesman Problem and Learning
Mikio L. Braun, Joachim M. Buhmann · The MIT Press eBooks · 2002
We consider noisy Euclidean traveling salesman problems in the plane, which are random combinatorial problems with underlying structure. Gibbs sampling is used to compute average trajectories, which estimate the underlying structure common to all instances.