Developed as a part of the Algorithm Design and Analysis class at PUC-Rio, this project utilizes a Branch and Bound algorithm to provide efficient and optimal solutions for the knapsack problem.
pedromsferraz / knapsackbranchandbound Goto Github PK
View Code? Open in Web Editor NEWBranch and Bound algorithm to provide efficient and optimal solutions for the knapsack problem.