Different solutions for the backpack problem, also known as Knapsack problem.
The first solution is a greedy algorithm that defines a solution from a comparator
The second solution is based on a genetic algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
santiguti/knapsack-problem
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
Different solutions for the backpack problem, also known as Knapsack problem