quadratic assignment problem

Assignment Problems in Cost Function Networks AAAI 2026 Phase Transition in Convex Relaxations for Graph Alignment COLT 2026 It's a (Blind) Match! Towards Vision-Language Correspondence without Parallel Data CVPR 2025 Graph Edit Distance with General Costs Using Neural Set Divergence NeurIPS 2024 Learning Solution-Aware Transformers for Efficiently Solving Quadratic Assignment Problem ICML 2024 Rethinking Parity Check Enhanced Symmetry-Preserving Ansatz NeurIPS 2024 Globally solving the Gromov-Wasserstein problem for point clouds in low dimensional Euclidean spaces NeurIPS 2023 Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching ICLR 2023 Towards Quantum Machine Learning for Constrained Combinatorial Optimization: a Quantum QAP Solver ICML 2023 Kernelized multi-graph matching ACML 2022 Orthogonal Gromov-Wasserstein discrepancy with efficient lower bound UAI 2022 Fusion Moves for Graph Matching ICCV 2021 Q-Match: Iterative Shape Matching via Quantum Annealing ICCV 2021 MINA: Convex Mixed-Integer Programming for Non-Rigid Shape Alignment CVPR 2020 KerGM: Kernelized Graph Matching NeurIPS 2019 Sliced Gromov-Wasserstein NeurIPS 2019 Generalizing Graph Matching beyond Quadratic Assignment Model NeurIPS 2018 Solving Partial Assignment Problems using Random Clique Complexes ICML 2018 A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching CVPR 2017 A Box-Constrained Approach for Hard Permutation Problems ICML 2016 Convex Relaxations for Permutation Problems NeurIPS 2013 Elastic Net Constraints for Shape Matching ICCV 2013 Kernelized Sorting NeurIPS 2008 Distance Patterns in Structural Similarity JMLR 2006