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

Etienne De Klerk(e.deklerkuvt.nl)
Renata Sotirov(R.Sotirovuvt.nl)

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].

Keywords: quadratic assignment problem, semidefinite programming

Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Citation: CenTER discussion paper Tilburg University, The Netherlands, June 2007.

Download: [PDF]

Entry Submitted: 06/13/2007
Entry Accepted: 06/13/2007
Entry Last Modified: 06/13/2007

Modify/Update this entry