Knapsack
6 methods in the atlas attack this one problem. They are rivals: each wins something the others do not.
Phrasings that mean this problem
Bounded selectionRepeatable selectionThe 0/1 knapsackKnapsack approximationKnapsack FPTASRevenue maximization
approximation
- PTAS for knapsackProfit scalingstandardapproximation
- Knapsack greedyDensity ratio with best single itemstandardapproximation
backtracking-cp
- Branch and boundFractional relaxation boundcanonfull lesson ▸backtracking-cp
dynamic-programming
- 0/1 knapsack DPstandalonecanondynamic-programming
- Unbounded knapsack DPstandalonestandarddynamic-programming
- Rod cutting DPstandalonecanondynamic-programming