note
rubasov
Think of the following: a solution to the 0-1 knapsack problem can be easily generalized to the bounded case, you just have to explicitly list the items with <c>nr>1</c>. Think of my previous example as this (just written abbreviated there):
<c>
w v v/w
3 3.1 31/30 # case a
2 2 1 # case b (together with the following line)
2 2 1 # case b
</c>
828578
828600