/genetic-knapsack-solver

This project implements a genetic algorithm to solve the knapsack problem, a combinatorial optimization problem. The program creates a set of items, each with a value and weight, and attempts to maximize the total value of items in a knapsack without exceeding its weight capacity.

Primary LanguageC++MIT LicenseMIT

Watchers