43 citations · 118 across the 4 of their papers we have counts for
1 paper · 1 filter
N. J. Cerf, J. Boutet de Monvel, O. Bohigas +2
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 distribute…