The Quadratic Assignment Problem (QAP) has remained one of the great challenges in combinatorial optimization. It is still considered a computationally nontrivial task to solve modest size problems, say of size n=25.

Further reading and discussion of the latest progress in this research area: www.miguelanjos.com/qaplib.