> Stuff you find in the papers there achieves state-of-the-art results very slowly (using integer linear programming or some rarely optimized heuristics) making you believe these instances of a general NP-hard problem can't be solved quickly.

Yes, or looking for things like mathematical purity, linear problem statement, etc

In practice: you don't need the best solution and you can get a great solution in a multitude of ways.