DP: Knapsack

The Knapsack problem is famous. How to fill a sack with items that are of maximal value without breaking the sack?

Slides