0-1 Knapsack Problem

Home page Home page
 Number of Items (n) 
Capacity (W)


 Item (i)   Weight (Wi  Profit (Pi
1
2
3


Maximum Profit: 3

Selected Items: [1, 2, 3]


Binary Table:

 X1   X2   X3   ∑ Profit 
0000
1001
0101
0011
1102
1012
0112
1113