The knapsack problem is a problem in combinatorial optimization. Take set of items, each with value and weight, specify the number of items to be included in the collection, so that the total value is as large as possible and total weight is less than or equal to the given limit.
-
Notifications
You must be signed in to change notification settings - Fork 0
zszkiladz/KnapsackProblem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The knapsack problem.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published