@techreport{87a5d12686e548638ea51a76fc5f25e7,

title = "Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem",

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]. AMS classification: 90C22, 20Cxx, 70-08.",

keywords = "quadratic assignment problem, semidefinite programming, group sym- metry",

author = "{de Klerk}, E. and R. Sotirov",

note = "Subsequently published in Mathematical Programming, 2010 Pagination: 21",

year = "2007",

language = "English",

volume = "2007-44",

series = "CentER Discussion Paper",

publisher = "Operations research",

type = "WorkingPaper",

institution = "Operations research",

}