← Lab · Chapter: DP for the 0/1 knapsack problem
DP tables for the knapsack problems¶
0/1, unbounded, bounded knapsack and subset sum: the table fills one cell at a time, with the cells it depends on; then the reconstruction of the solution. ◀ ▶ one step at a time, «Run» to watch them all (choose the speed); the «Instance» menu and «Edit…» change the instance.