Dual decomposition solvers for the quadratic assignment problem (QAP), also called graph matching in computer vision based on the LP_MP library.
-
Updated
Aug 15, 2018 - C++
Dual decomposition solvers for the quadratic assignment problem (QAP), also called graph matching in computer vision based on the LP_MP library.
Code to solve the Quadratic Assignment Problem running the Differential Evolution algorithm, using CUDA acceleration.
🧠 A set of metaheuristics applied in solving the QAP problem, including local search, genetic algorithms, memetics and more.
Iterated Local Search: Quadratic Assignment Problem
Add a description, image, and links to the qap topic page so that developers can more easily learn about it.
To associate your repository with the qap topic, visit your repo's landing page and select "manage topics."