News for hackers. Stuff that matters.
Re:Solving TSP: From Heuristics to a Potential Polynomial-Ti... by jepler on Monday December 30, 2024 @10:46PM (#42556243)
According to http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/STSP.h... the optimal solution for eil51 is 426 (the linked page has a tour of 428.87) and the optimal solution for st70 is 675 (the linked page has a tour of 677.11).
Re:Solving TSP: From Heuristics to a Potential Polynomial-Ti... by RA2lover on Monday December 30, 2024 @11:10PM (#42556334)
What's with the 12-34-21-33 loop shown on Concorde's st70 path as shown on OP's article? You'd expect it to avoid intersecting routes in a final answer to a given problem.