Estimating the duration of the Branch and Bound algorithm for 0-1 Knapsack problems

The Branch and Bound method is a very useful method for nding solutions to optimization problems. However it does come with some problems as the search tree used for the Branch and Bound algorithm can be very large in size and can result in very long processing times as well as a large memory use. There is currently no known way to exactly know...