Packaged are two implementations:
- Dynamic Programming (Faster, but fails on very large problem > ~100k items)
- Branch and Bound (Memory efficient, successfully runs large instances)
-
Notifications
You must be signed in to change notification settings - Fork 0
mohit-mhjn/zero1_knapsack_optimizer
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Solvers for Large Scale 0-1 Knapsack problems
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published