2 papers
math.OC2024
Exactness Conditions for Semidefinite Relaxations of the Quadratic Assignment Problem
Junyu Chen, Yong Sheng Soh
The Quadratic Assignment Problem (QAP) is an important discrete optimization instance that encompasses many well-known combinatorial optimization problems, and has applications in…
math.OC2024
Semidefinite Relaxations of the Gromov-Wasserstein Distance
Junyu Chen, Binh T. Nguyen, Shang Hui Koh +1
The Gromov-Wasserstein (GW) distance is an extension of the optimal transport problem that allows one to match objects between incomparable spaces. At its core, the GW distance is…