0 votes 0 votes 5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) and weight W=(4,3,6,2,2.). Solve it using dynamic programming approach. Algorithms algorithms knapsack-problem dynamic-programming + – Syedabbas110 asked Oct 30, 2017 • edited Jun 23, 2022 by makhdoom ghaya Syedabbas110 2.8k views answer comment Share Follow See 1 comment See all 1 1 comment reply Lakshman Bhaiya commented Nov 10, 2018 reply Follow Share $14$ is the correct answer Using Dynamic Programming $(0/1)$ Knapsack Problem. And $13.5$ Using Greedy Algorithm, Fractional knapsack problem. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 5 5 5 5 5 5 5 0 0 0 4 5 5 5 9 9 9 9 9 0 0 0 4 5 5 7 9 9 9 9 9 0 0 2 4 5 6 7 9 9 11 12 13 0 0 3 4 5 7 8 9 10 12 12 14 Columns w represents weights <0, 1, 2, 3, ........11> Rows i represent Item number <0, 1, 2, 3, 4, 5> cell <i, w> indicates total profit P by "including any/some/all of the first i items in knapsack having combined weight w" verify it !! akshayaK answered Nov 10, 2018 akshayaK comment Share Follow See all 0 reply Please log in or register to add a comment.