Explain the ‘branch and bound’ approach for solving problems for solving the 0/1 Knapsack problem.
Channel:
Subscribers:
108
Published on ● Video Link: https://www.youtube.com/watch?v=i8AojMqi7aU
Explain the ‘branch and bound’ approach for solving problems. Write a\nbranch and bound algorithm for solving the 0/1 Knapsack problem. Use\nthe same algorithm to solve the following 0/1 Knapsack problem. The\ncapacity of the knapsack is 15 kg. [9]\nItem A B C D\nProfit(Rs.) 18 10 12 10\nWeight (Kg.) 9 4 6 2
Like share and subscribe ❤️
\n#daa #cs #university