Quadratic Assignment Problem (QAP)

Quadratic Assignment Problem (QAP) #

The Quadratic Assignment Problem is a classical NP-hard combinatorial optimization problem with applications in location theory and circuit design.

Recent Literature #

1. Revised Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks Arxiv, 2017. paper, code

   Nowak, Alex and Villar, Soledad and Bandeira, S. Afonso and Bruna, Joan

2. ⭐Neural Graph Matching Network: Learning Lawler’s Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching. TPAMI, 2021. paper, code

   Wang, Runzhong and Yan, Junchi and Yang, Xiaokang

3. ⭐Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching. ICLR, 2023. paper, code

   Liu, Chang and Jiang, Zetian and Wang, Runzhong and Yan, Junchi and Huang, Lingxiao and Lu, Pinyan

4. ⭐Towards Quantum Machine Learning for Constrained Combinatorial Optimization: a Quantum QAP Solver ICML, 2023. paper

   Ye, Xinyu and Yan, Ge and Yan, Junchi