29 citations · 95 across the 14 of their papers we have counts for
1 paper · 1 filter
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…