python
genetic-algorithm
knapsack-problem
0-1-knapsack
0-1-knapsack-problem
01knapsack
tournament-selection
crossover-operator
-
Updated
Dec 31, 2023 - Jupyter Notebook
This repo. is mainly for AWINLAB LAB admission homework.
We have a set of items, each with a weight (Wi) and a value (Vi), determine the number of each item included in a collection so that the total weight is less than or equal to a given limit of knapsack and the total value is as large as possible.
might be helpful
Add a description, image, and links to the 01knapsack topic page so that developers can more easily learn about it.
To associate your repository with the 01knapsack topic, visit your repo's landing page and select "manage topics."