4 ms·
Integer linear programming is NP-hard, which may have caused the confusion here.
by pjscott 6y ago
Integer linear programming is NP-hard, which may have caused the confusion here.
- Animats 6y agoThe classic simplex method for real linear programming is exponential-time in worst case, but cubic time in the average case. Newer algorithms can beat that.