Minimum energy configurations on a toric lattice as a quadratic assignment problem

Daniel Brosch, Etienne de Klerk

We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound. Since th…