Bounded knapsack

Revision en1, by ioi_want, 2020-11-26 17:38:50

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?

Tags knapsack


  Rev. Lang. By When Δ Comment
en1 English ioi_want 2020-11-26 17:38:50 320 Initial revision (published)