This is a program that use four kinds of global search to solve the Multiple Quadratic Knapsack Problem. The used types of global search are Simulated Annealing, Tabu Search, GRASP and Iterated Greedy.
This is a program that use four kinds of global search to solve the Multiple Quadratic Knapsack Problem. The used types of global search are Simulated Annealing, Tabu Search, GRASP and Iterated Greedy.