bounded knapsack

Revision en4, by nagato_uzumaki, 2020-11-06 21:04:22

I was struggling to figure out states and transitions for bounded knapsack problem which is the most general case of knapsack problem, so please if someone can share some insights and code for this, it will be very helpful for us.

For those who may not be familiar with this term bounded knapsack:-

The bounded knapsack problem is like the 0/1 knapsack problem, except in this we are also given a count for each item. In other words, each item has a count si associated with it and we can select an item si times(at max) (1 ≤ i ≤ N).

Ok, finally I got this nice article written by Petr !

Tags #dynamic programing

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English nagato_uzumaki 2020-11-06 21:04:22 0 (published)
en3 English nagato_uzumaki 2020-11-06 19:18:26 143 Tiny change: 'en by Petr' -> 'en by Petr !' (saved to drafts)
en2 English nagato_uzumaki 2020-11-06 12:58:47 2
en1 English nagato_uzumaki 2020-11-06 12:54:37 557 Initial revision (published)