There are 4 repositories under quadratic-assignment-problem topic.
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.
Solution quadratic assign problem via LS(local search), ILS(iterated local search), GLS(guided local search)
The research work on local search algorithms
Implementation of different algorithms: heuristic search, Simulated Annealing, Ant Colony Algorithm and Tabu Search to a Quadratic Assignment Problem.
Algorithms for solving the Quadratic Assignment Problem
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.
Algorithms for solving the quadratic assignment problem (QAP) implemented in Julia.
Quadratic Assignment Problem, an Enhanced Solver
laboratory works for combinatoric optimization course
Solving quadratic assignment problem using iterated local search, improved hybrid genetic algorithm, tabu search, and constraint solving.
Applications of Metaheuristic Optimization in Python
This is the official code for the AISTATS 2023 paper "Learning Constrained Structured Spaces with Application to Multi-Graph Matching"
This Rust program accepts command-line arguments and functions as a quadratic equation solver, akin to the 'Almighty Formula.' It can solve any quadratic equation of the form ax^2 + bx + c = 0, provided that you correctly pass the expected arguments.
Testing three Genetic Algorithm on three datasets to check their performance.
Code and experiment data from the paper: "Cycle Mutation: Evolving Permutations via Cycle Induction"
Quadratic Assignment Problem visualizer written using Allegro game library
Repo de la materia de TSO, trae cosas de Knapsack, TSP y Quadratic Assignment Problem
This repository utilizes social network analysis (SNA) to analyze multiple social networks. Clustering algorithms were used to explore sub-groups and QAP was implemented for non-parametric multiple regression analysis.
Solving a QAP instance using genetic algorithms
Product Positioning via multidimensional scaling, using R to perform QAP correlation testing
Iterated Local Search: Quadratic Assignment Problem