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.
-
Notifications
You must be signed in to change notification settings - Fork 0
pedromsferraz/KnapsackBranchAndBound
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Branch and Bound algorithm to provide efficient and optimal solutions for the knapsack problem.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published