Algorithms for solving the quadratic assignment problem (QAP) implemented in Julia.
-
Updated
May 20, 2021 - Julia
Algorithms for solving the quadratic assignment problem (QAP) implemented in Julia.
Experiments for investigating seeded graph matching for weakly-correlated graphs.
Add a description, image, and links to the graph-matching topic page so that developers can more easily learn about it.
To associate your repository with the graph-matching topic, visit your repo's landing page and select "manage topics."