3 ms·

> Problems with variables that are constrained to be integer can take much longer, but they are orders of magnitude more efficient today than a few years ago.

by Scea91 9y ago

> Problems with variables that are constrained to be integer can take much longer, but they are orders of magnitude more efficient today than a few years ago. Yet, they are still NP-complete.

lorenzhs 9y ago
Doesn't mean that you can't write efficient heuristics that find close-to-optimal or even optimal solutions for a wide variety of practical instances.
merraksh 9y ago
Indeed. Unless we prove P=NP, technology will only help re-define what "practically solvable" problems are.