Question: Please solve the question. What is branch and bound algorithm? Let we have N=4 and capacity of the knapsack is 16 and set of profit
Please solve the question.
What is branch and bound algorithm? Let we have N=4 and capacity of the knapsack is 16 and set of profit as P= {45, 30, 45, 10} and associated weights of these objects are {3, 5, 9, 5}. Now your target is to achieve the maximum profit using capacity of the knapsack using BnB algorithms.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
