Algorithms.
for every node and compare the bound with current best solution before exploring the node. To find bound for every node for Knapsack: To check if a particular node can give us a better solution or not, we compute the optimal solution (through the node) using Greedy method. If the solution computed