A research protocol for deep graph matching.
-
Updated
Jun 20, 2024 - Python
A research protocol for deep graph matching.
Python library for finding the optimal transformation(s) that makes two matrices as close as possible to each other.
laboratory works for combinatoric optimization course
Mapping and routing of a data flow network mapped on an mesh NoC
Solution quadratic assign problem via LS(local search), ILS(iterated local search), GLS(guided local search)
Solving quadratic assignment problem using iterated local search, improved hybrid genetic algorithm, tabu search, and constraint solving.
This is the official code for the AISTATS 2023 paper "Learning Constrained Structured Spaces with Application to Multi-Graph Matching"
Genetic algorithm for solving quadratic assignment problem
This is a Python implementation of the Doubly Stochastic Projected Fixed Point (DSPFP) algorithm for solving the Quadratic Assignment Problem / Graph Matching..
Unofficial implemnetation of "Solving Quadratic Assignemt Problem using Deep Reinforcement Learning" (https://arxiv.org/abs/2310.01604)
This package supports general, orthogonal, rotation, permutation, projection, and symmetric Procrustes problems, including both the normal one-sided approach and (for orthogonal and permutation Procrustes) two-sided approaches, where both the rows and columns are transformed.
Applications of Metaheuristic Optimization in Python
Add a description, image, and links to the quadratic-assignment-problem topic page so that developers can more easily learn about it.
To associate your repository with the quadratic-assignment-problem topic, visit your repo's landing page and select "manage topics."