algo
now
.net
AI scenarios
practice areas
algo puzzles
Legacy reference
lessons
atlas
problems
fields
legacy
/
algorithms
/
Unbounded knapsack DP
Unbounded knapsack DP
Pairings in the atlas
standalone
standard
Repeatable selection
dynamic-programming
Rivals: other methods for the same problems
0/1 knapsack DP
Branch and bound
Knapsack greedy
PTAS for knapsack
Rod cutting DP
Where it sits
dynamic-programming
·
Dynamic Programming & Combinatorics