> In other words, this is not practical to solve problems with moderate to large size n. This depends entirely on your definition of "moderate to large". Many

> In other words, this is not practical to solve problems with moderate to large size n. This depends entirely on your definition of "moderate to large". Many real world problems can be solved easily using existing MILP solvers. We will likely never find an algorithm that can solve arbitrarily large instances of NP-complete problems in practice. Heck, it's easy to generate lists that are to large to be sorted with O(n^2) bubblesort.