Solving Knapsack problem using different methods:
- Explicit
- Branch & Bound
- Heuristics
- Dynamic programming (Decomposition by price and weight)
- FPTAS
- Iterative (Genetic programming)
-
Notifications
You must be signed in to change notification settings - Fork 0
MichalSousedik/KnapsackProblem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
np-complete
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published