0
$\begingroup$

Given that we have a set of items :- { (c1, w1) , (c2, w2), (c3, w3) , ... } where (ci, wi) are the respective cost and weight of the ith item. Its required to minimize total cost of items C such that total weight of the items always sums up to value 'W' (non-negative integer) and total number of items cannot exceed 'n'.

  • 0
    Knapsack problem ideas may help http://en.wikipedia.org/wiki/Knapsack_problem2012-08-08

1 Answers 1