Abstract
| Original language | English |
|---|---|
| Pages (from-to) | 225-246 |
| Journal | Mathematical Programming |
| Volume | 122 |
| Issue number | 2 |
| Publication status | Published - 2010 |
Fingerprint
Cite this
}
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. / de Klerk, E.; Sotirov, R.
In: Mathematical Programming, Vol. 122, No. 2, 2010, p. 225-246.Research output: Contribution to journal › Article › Scientific › peer-review
TY - JOUR
T1 - Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
AU - de Klerk, E.
AU - Sotirov, R.
N1 - Appeared earlier as CentER DP 2007-44
PY - 2010
Y1 - 2010
N2 - 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].
AB - 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].
M3 - Article
VL - 122
SP - 225
EP - 246
JO - Mathematical Programming
JF - Mathematical Programming
SN - 0025-5610
IS - 2
ER -