CLICK HERE;subset sum problem- backtracking method
Posts
MultiStage Graph:Dynamic Programming approach
calculate step: Bcost(3,j) Bcost (3, 6) = min {Bcost (2, 2) + c (2, 6), Bcost (2, 3) + c (3, 6)} = min {Bcost (2, 2) + 4, Bcost (2, 3) + 2} =min{ 9+4,7+2}= 9 l min(3, 6) = 3 Bcost (3, 7) = min {Bcost (2, 2) + c (2, 7), Bcost (2, 3) + c (3, 7)} = min {9 + 2, 7 + 7, 2 + 11} = min {11, 14, 13} = 11 l min(3, 7) = 2 Bcost (3, 8) = min {Bcost (2, 2) + c (2, 8), Bcost (2, 4) + c (4, 8), Bcost (2, 5) + c (5, 8)} = min {9 + 1, 3 + 11, 2 + 8} = min {10, 14, 10} = 10 l min(3, 8) = 2 calculate step: Bcost(4,j) Bcost (4, 9) = min {Bcost (3, 6) + c (6, 9), Bcost (3, 7) + c (7, 9)} = min {Bcost (3, 6) + 6, Bcost (3, 7) + 4} ...
