Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem

Research output: Contribution to journalArticleScientificpeer-review

52 Citations (Scopus)
320 Downloads (Pure)

Abstract

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].
Original languageEnglish
Pages (from-to)225-246
JournalMathematical Programming
Volume122
Issue number2
Publication statusPublished - 2010

Fingerprint Dive into the research topics of 'Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem'. Together they form a unique fingerprint.

Cite this