Consider a solution of 0-1 knapsack problem using branch and bound. Following describes 0-1 knapsack problem: There are 7 items with weight w = {40, 50, 30, 10, 10, 40, 30} and profit p = {40, 60, 10, 10, 3, 20, 60}. The total allowable weight is W = 100. What is the upper bound value we shall consider to solve this problem?
