This project applies a genetic algorithm to solve the knapsack problem for a given weight and value of items.
- Chromosome: A binary list indicating which items are selected.
- Maximizes total value while staying under the weight limit.
Knapsack
Directory actions
More options
Directory actions
More options
Knapsack
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||