News for hackers. Stuff that matters.
Re:The Scientific Case for P≠NP by lokerfoi on Wednesday November 01, 2017 @09:24AM (#15600893)
One of the best public examples is LKH solver for travelling salesman. I'm not familiar with problems for which proving optimality of a solution to a specific problem instance is not accomplished.

For example, for travelling salesman and vehicle routing there are many instances with known optimum.

Even for those unknown tight bounds are easily achieved.

There are no comments on this comment yet.