Comment by amscanne

Comment by amscanne 3 months ago

What are you actually expecting here?

The solution was found in a few days by the LKH TSP heuristic solver. They spent months (and decades of CPU time) using well-known techniques to bound the specific problem and prove that this was an optimal solution. It’s not something that you can synthesize to a page. They are literally announcing that they verified the heuristic-derived solution.

Consider it like any science, where folks can make shit up. But you can just run the bounding algorithms yourself, or prove they are incorrect.

moralestapia 3 months ago

[flagged]

Reply View 1 reply

amscanne 3 months ago

The proof here is essentially the execution log of the bounding program. I imagine that this would be TB, PB or beyond. Not every proof is some clever paper, some are just brute force. Like proving a number is prime, or calculating the Nth digit of Pi. A paper doesn’t always make sense, but you can still announce what you’ve done (and maybe you get a paper with algorithmic details, but it’s not a proof for specific the instance).

Reply View | 0 replies