__Given two n-tuples of positive numbers (<V__

**0-1 Knapsack Problem :**_{1},V

_{2},.....,V

_{n}) and (<w

_{1},w

_{2},w

_{3},.....,w

_{n}and W>0, We wish to determine the subset T∈{1,2,3,....,n} (of files to store)) that maximizes ∑

_{ieT}V

_{i}subject to ∑

_{ieT}w

_{i}≤W