Metaheuristic problems
-
Updated
May 1, 2018 - C
Metaheuristic problems
Résolution du problème du sac à dos multidimensionnel (Multidimensional Knapsack Problem) grâce à plusieurs approches méta-heuristiques : algorithme génétique, Variable Neighborhood Search (VNS), Variable Neighborhood Descent (VND), et opérateurs de voisinage (swap, flip)
Exact and GRASP+VNS algorithms for the minimum labelling Steiner tree problem
Add a description, image, and links to the vns topic page so that developers can more easily learn about it.
To associate your repository with the vns topic, visit your repo's landing page and select "manage topics."