Search Results for author:
Found 1 papers, 1 papers with code
Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances
The Quadratic Assignment Problem (QAP) is one of the major domains in the field of evolutionary computation, and more widely in combinatorial optimization.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
