3 ms·
Great article. Got me thinking if this could be used to solve the knapsack problem.
by atum47 4y ago
Great article. Got me thinking if this could be used to solve the knapsack problem.
- evolveyourmind 4y agoYes, knapsack can be optimally solved with these solvers. Indeed, the time complexity of these optimisers is exponential.
- rich_sasha 4y agoYou can. It is a straightforward MILP program. The issue is, MILP in general is NP-complete to solve... so it doesn’t gain you anything. In practice solutions can be found quickly, or at least good approximations.
- atum47 4y agoYep, remember studying the solution using dynamic programming, back in college