de Klerk, Etienne; Sotirov, Renata - Tilburg University, Center for Economic Research - 2007
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group … assignment problems from the problem library: [R.E. Burkard, S.E. Karisch, F. Rendl. QAPLIB — a quadratic assignment problem … symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic …