Purpose Develop a solution to 0-1 knapsack problem by applying branch and bound constraints to a basic exhaustive search solution. Related projects and repos https://github.com/hughdbrown/knapsack_utils https://github.com/hughdbrown/exhaustive-search https://github.com/hughdbrown/rods-technique https://github.com/hughdbrown/dynamic-programming https://github.com/hughdbrown/test-knapsack-algos