Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances
(2024)
Presentation / Conference Contribution
Verel, S., Thomson, S. L., & Rifki, O. (2024, April). Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances. Presented at EvoCOP 2024, Aberystwyth, UK
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 phase transition of the QAP, which can be described as a dramatic chang... Read More about Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances.