ioi_want's blog

Bounded knapsack
By ioi_want, history, 4 years ago, In English

Does any body have judge for this problem? There are N type of items, for type i three integers is given w_i(weight of the item), v_i(value of the item), c_i(the number item that we have). The capacity of knapsack is W. we want to choose some item so that we have the maximum value. What is that value?

  • Vote: I like it
  • +5
  • Vote: I do not like it

Comments Comments (1)
| Write comment?
»
4 years ago, # |
  Vote: I like it +5 Vote: I do not like it

OK. Does anybody know the solution of the problem?

→ Reply