Dynamic programming 0/49

Knapsack DP: capacity tables and grid paths · 2 of 2

Knapsack

Choose items under a weight limit with a state for the items considered and the capacity, keep one row of the table, and reuse it for reachable sums, counts and unlimited copies.

5,318 words · 24 min read

Books1

Links6

More links1