ConceptQAP / Quadratic Assignment Problem
Quadratic Assignment Problem
The quadratic assignment problem (QAP) is a classical NP-hard problem in combinatorial optimization, introduced by Koopmans and Beckmann in 1957. It seeks an optimal matching between two sets of objects so that pairwise association costs are minimized or maximized. It has broad applications in graph matching, chip layout, and protein structure alignment.
Timeline (last 90 days)
Nov 8
The computation of the GW distance is usually transformed into a quadratic assignment problem, whose objective function is non-convex with respect to the coupling matrix.
Unverified50%