0/1 Knapsack Problem

A knapsack has fixed capacity which needs to be filled with items in such a way that it will carry highest values (optimal load). This is a classical problem of DP (Dynamic Programming).