Implementation of Branch And Bound for 0/1 Knapsack and Travelling Salesman Problem, parallelized using OpenMP and MPI.