We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard, S.E. Karisch, F. Rendl. QAPLIB - a quadratic assignment problem library. Journal on Global Optimization}, 10: 291--403, 1997].
Citation
Mathematical Programming A, to appear. Note: Theorem 7.3 is incorrect as stated in the journal version, but correct in the version posted here.