## 0/1 MultiDimensional Knapsack Problem

hello guys. im in trouble with 01MKP. Actually I dont know how to ask. If there is someone who is familiar this problem, im asking him/her

There is dataset for test this algorithm from JE beasley ( Here: http://people.brunel.ac.uk/~mastjjb/...les/mknap2.txt )

in this data set, we have 2 knapsack with capacities 600. 28 items with different weights. and each item has different constraint for each knapsack.
For example, item #1 has 1898 weight. the capacity of knapsack #1 is 600 (smaller than item)

And in the constr list #1, item #1 has 45 constraint for knapsack 1.

Can someone tell me how we can determine this 45 value? I mean what is the tricky point in this stupid problem:\

2 28 // 2 knapsacks, 28 objects
1898 440 22507 270 14148 3100 4650 30800 615 4975
1160 4225 510 11880 479 440 490 330 110 560
24355 2885 11748 4550 750 3720 1950 10500 // 28 weights
600 600 // 2 knapsack capacities
45 0 85 150 65 95 30 0 170 0
40 25 20 0 0 25 0 0 25 0
165 0 85 0 0 0 0 100 // #1 constr.
30 20 125 5 80 25 35 73 12 15
15 40 5 10 10 12 10 9 0 20
60 40 50 36 49 40 19 150 // #2 constr.