No article text was recorded for this version.
quadratic assignment problem
Version 1 of 157 papers57 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Deep Learning of Graph Matching
- Blog: Pygmtools: A Python Graph Matching Toolkit
- Blog: Weisfeiler-Leman in the BAMBOO: Novel AMR Graph Metrics and a Benchmark for AMR Graph Similarity
- Blog: Proxy Graph Matching with Proximal Matching Networks
- Blog: Random Graph Matching with Improved Noise Robustness
- Blog: Spectral Graph Matching and Regularized Quadratic Relaxations: Algorithm and Theory
- Blog: Attributed Network Alignment: Statistical Limits and Efficient Algorithm
- Blog: Ensemble Quadratic Assignment Network for Graph Matching
- Blog: Joint Alignment of Multiple Protein-Protein Interaction Networks via Convex Optimization
- Blog: The Role of Codeword-to-Class Assignments in Error-Correcting Codes: An Empirical Study
- Blog: Shape-Graph Matching Network (SGM-net): Registration for Statistical Shape Analysis
- Blog: Local Optimization for Global Alignment of Protein Interaction Networks
- Blog: Aligning Embeddings and Geometric Random Graphs: Informational Results and Computational Approaches for the Procrustes-Wasserstein Problem
- Blog: Stochastic Iterative Graph Matching
- Blog: Pairwise Matching through Max-Weight Bipartite Belief Propagation
- Blog: Exact Recovery with Symmetries for the Doubly Stochastic Relaxation
- Blog: T-GAE: Transferable Graph Autoencoder for Network Alignment
- Blog: Learning Combinatorial Embedding Networks for Deep Graph Matching
- Blog: MRFalign: Protein Homology Detection through Alignment of Markov Random Fields
- Blog: IA-GM: A Deep Bidirectional Learning Method for Graph Matching
- Blog: SDRSAC: Semidefinite-Based Randomized Approach for Robust Point Cloud Registration Without Correspondences
- Blog: Incorporating Domain Knowledge in Matching Problems via Harmonic Analysis
- Blog: Effiecient Graph Matching by Adjacency Matrix Based Model and Gaussian Smoothing Based Optimization
- Blog: Dscorer: A Fast Evaluation Metric for Discourse Representation Structure Parsing
- Blog: AlignGraph: A Group of Generative Models for Graphs
- Blog: Heat Kernels, Manifolds and Graph Embedding
- Blog: A Comparative Study of Graph Matching Algorithms in Computer Vision
- Blog: Spectral Alignment of Graphs
- Blog: (Probably) Concave Graph Matching
- Blog: Learning Combinatorial Solver for Graph Matching
- Blog: Algorithms for Large, Sparse Network Alignment Problems
- Blog: Nonnegative Orthogonal Graph Matching
- Blog: Contrasting Quadratic Assignments for Set-Based Representation Learning
- Blog: Determinant Regularization for Gradient-Efficient Graph Matching
- Blog: Learning Partial Graph Matching via Optimal Partial Transport
- Blog: fGOT: Graph Distances Based on Filters and Optimal Transport
- Blog: FRAM: Frobenius-Regularized Assignment Matching with Mixed-Precision Computing
- Blog: Smatch: an Evaluation Metric for Semantic Feature Structures
- Blog: A Unified View of Evaluation Metrics for Structured Prediction
- Blog: GMTR: Graph Matching Transformers
- Blog: Keyword Search on RDF Graphs - A Query Graph Assembly Approach
- Blog: A game-theoretic approach to deformable shape matching
- Blog: Adiabatic Quantum Graph Matching with Permutation Matrix Constraints
- Blog: IA-NGM: A bidirectional learning method for neural graph matching with feature fusion
- Blog: Fast Approximate Quadratic Programming for Graph Matching
- Blog: Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm
- Blog: SMATCH++: Standardized and Extended Evaluation of Semantic Graphs
- Blog: Network two-sample test for block models
- Blog: Deep Graph Matching Consensus
- Blog: SemBleu: A Robust Metric for AMR Parsing Evaluation
- Blog: Graph Matching: Relax at Your Own Risk
- Blog: Self-Supervised Bidirectional Learning for Graph Matching
- Blog: Neural Analogical Matching
- Blog: FUGAL: Feature-fortified Unrestricted Graph Alignment
- Blog: Deformable Surface Tracking by Graph Matching
- Blog: Discovering large conserved functional components in global network alignment by graph matching
- Blog: Adaptively Transforming Graph Matching
History & citation
Current · Permanent link
- This direction split from Continuous Relaxations for Graph Matching (82% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_quadratic_assignment_problem_5ffb0b66,
title = {quadratic assignment problem},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/quadratic-assignment-problem/rdr_5ffb0b66f3dd4fe8bff00dfc60619807},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_quadratic_assignment_problem_5ffb0b66_v1,
title = {quadratic assignment problem},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/quadratic-assignment-problem/rdr_5ffb0b66f3dd4fe8bff00dfc60619807/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}