most citedSubfunction Structure Matters: A New Perspective on Local Optima Networks

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing cs.AIShow all

1 paper · 1 filter

cs.AI2024

Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances

Sébastien Verel, Sarah Thomson, Omar Rifki

The Quadratic Assignment Problem (QAP) is one of the major domains in the field of evolutionary computation, and more widely in combinatorial optimization. This paper studies the p…