3 ms·

Being NP-hard doesn't mean it's unsolvable at all. It means it's not solvable quickly. Google maps does this millions of times per day... the number of points o

by gleenn 3y ago

Being NP-hard doesn't mean it's unsolvable at all. It means it's not solvable quickly. Google maps does this millions of times per day... the number of points on the trip are few enough that you can brute force it perfectly or use a heuristic to solve it faster but less optimally. Very solvable just not optimizable algorithmicly.

Sai_ 3y ago
My answer that you are replying to ends with “…with current technology” which contains what you said.
- gleenn 3y ago
  The technology doesn't matter unless you're going to make a far-fetched quantum computer argument. This is pure math.