Best known solutions for symmetric TSPs



What I had not expected when publishing this library about 10 years ago:
Due to enormous algorithmic progress all problems except for pla85900 are now solved to optimality!!

For all other problems the tour lengths are provably optimal (with respect to the distance definition in TSPLIB).
The lower bound for pla85900 has been obtained using CONCORDE by Bill Cook, Daniel Espinoza
and Marcos Goycoolea, the best tour has been found by Keld Helsgaun.



Return to our group