This is the dynamic programming, branch and bound and branch and bound low memory solver to solve large instances of the knapsack problem. This was written as part of the course Discrete Optimization on Coursera by Professor. Pascal Van Hentenryck of University of Melbourne.
-
Notifications
You must be signed in to change notification settings - Fork 7
This is the dynamic programming, branch and bound and branch and bound low memory solver to solve large instances of the knapsack problem. This was written as part of the course Discrete Optimization on Coursera by Professor. Pascal Van Hentenryck of University of Melbourne.
License
mod0/knapsack
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
This is the dynamic programming, branch and bound and branch and bound low memory solver to solve large instances of the knapsack problem. This was written as part of the course Discrete Optimization on Coursera by Professor. Pascal Van Hentenryck of University of Melbourne.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published