Average optimal cost for the Euclidean TSP in one dimension

Sergio Caracciolo, Andrea Di Gioacchino, Enrico M. Malatesta +1

The traveling-salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We stu…