Implementation of the 0-1 Knapsack Problem

A genetic algorithm implementation of the binary Knapsack problem.

Solving binary knapsack problem using genetic algorithm

It is a classic dynamic programming problem in which we have to collect items in the knapsack in such a way that our profit is maximized. The difference between this problem and the fractional knapsack one is that you CANNOT take a fraction of an item.

Comparison of greedy algorithm and dynamic programming for the binary knapsack problem

Python implementation of a Genetic Algorithm to solve large scale binary knapsack problem

C++ implementation of a genetic algorithm for the binary knapsack problem.