edmilsonrobson/0-1-Knapsack-Problem-with-Genetic-Algorithms

A simple solution in Python for the 0-1 Knapsack Problem using Genetic Algorithms

Stars: 23
Forks: 14
Open beginner issues: 0
Indexed issues: 1

Dominant language: Python
License: MIT
Last GitHub push: Jul 14, 2016
Latest indexed: Sep 15, 2026
Contributing guide: No contributing guide
Code of conduct: No code of conduct
Beginner labels: No beginner labels indexed
PR merge metrics: No merged PRs in 30d

Open All

1 open issue indexed

0-1 Knapsack Problem Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the c Open

edmilsonrobson/0-1-Knapsack-Problem-with-Genetic-Algorithms#1 · 1 comment · 0 reactions · 0 assignees · Indexed Sep 15, 2026

A short digest of beginner-friendly GitHub issues.