DaCasBe / Multiple-Quadratic-Knapsack-Problem-using-Population-based-Metaheuristics

This is a program that use two metaheuristics to solve the Multiple Quadratic Knapsack Problem. The used metaheuristics are a Genetic Algorithm and the Ant Colony Optimization.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

DaCasBe/Multiple-Quadratic-Knapsack-Problem-using-Population-based-Metaheuristics Stargazers