← Lab · Chapter: Knapsack problems

Brute force on the 0/1 knapsack problem

All the 2ⁿ subsets of items, one at a time: which ones are feasible, the best one found and the combinatorial explosion. ◀ ▶ one subset at a time, «Run» to watch them all; the «Instance» menu, «+ item» and «− item» change the instance.