Thumbnail Image
Item

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

de Klerk,E.
; 
Sotirov,R.
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].
Description
Appeared earlier as CentER DP 2007-44
Date
2010
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Files
Thumbnail Image
Exploiting1.pdf
Adobe PDF, 212.52 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
de Klerk, E & Sotirov, R 2010, 'Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem', Mathematical Programming, vol. 122, no. 2, pp. 225-246.
URI
https://hdl.handle.net/20.500.14602/49371
Embedded videos