Branch and Bound for 0/1 Knapsack Problem This project implements the Branch and Bound algorithm to solve the 0/1 Knapsack Problem, a classic optimization problem in computer science