LATIHAN 17
• Hitung penyelesaian 0/1 Knapsack Problem berikut
dengan menggunakan Dynamic Programming !
 n = 7; W = 10; (w1, w2, w3, w4, w5, w6, w7) = (5, 2, 3, 6,
4, 3, 2); (b1, b2, b3, b4, b5, b6, b7) = (36, 16, 21, 57, 28,
24, 13)
 n = 8; W = 9; (w1, w2, w3, w4, w5, w6, w7) = (5, 2, 3, 2,
6, 2, 4, 3); (b1, b2, b3, b4, b5, b6, b7) = (32, 59, 30, 17,
81, 16, 39, 25)
Bina Nusantara