Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Solving TSP: From Heuristics to a Potential Polynomial-Time Breakthrough
(
prat8897.github.io
)
3 points
by
signa11
on Dec 31, 2024
|
hide
|
past
|
favorite
|
2 comments
jepler
on Dec 31, 2024
[–]
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).
RA2lover
on Dec 31, 2024
|
parent
[–]
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.
Consider applying for YC's Fall 2026 batch!
Applications
are open till July 27.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
