Branch and Bound is an algorithm for solving discrete optimization problems. The algorithm is implemented in python. The libraries Pulp (for solving the LPs in every step) and Treelib (for the implementation of tree data structure) are used. I also have used the web framework Web2Py for creating a web app and Google Charts for visualizing my results.