QAP is an NP-hard problem, but in the range of problem sizes that we need to tackle the problem can be solved efficiently.
using standard off-the-shelf integer program solvers, we are able to solve the QAP problems in our experiments in under a second.