The random link approximation for the Euclidean traveling salesman problem
N. J. Cerf 1, J. Boutet de Monvel 1, O. Bohigas 1, O. C. Martin 1, A. G. Percus 1 Journal de Physique I 7 (1997) 117-136 The traveling salesman problem (TSP) consists of finding the length of the shortest closed tour visiting N « cities\’\’. We consider the Euclidean TSP where the cities are distributed randomly and independently in a d-dimensional unit hypercube. Working with […]
The random link approximation for the Euclidean traveling salesman problem Lire la suite »