Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem

CentER Discussion Paper Series No. 2007-44

21 Pages Posted: 25 Jun 2007

See all articles by Etienne de Klerk

Etienne de Klerk

Tilburg University

Renata Sotirov

Tilburg University - Tilburg University School of Economics and Management

Date Written: June 2007

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

JEL Classification: C61

Suggested Citation

de Klerk, Etienne and Sotirov, Renata, Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem (June 2007). Available at SSRN: https://ssrn.com/abstract=995407 or http://dx.doi.org/10.2139/ssrn.995407

Etienne De Klerk (Contact Author)

Tilburg University ( email )

P.O. Box 90153
Tilburg, 5000 LE
Netherlands

Renata Sotirov

Tilburg University - Tilburg University School of Economics and Management ( email )

P.O. Box 90153
Tilburg, 5000 LE
Netherlands

Here is the Coronavirus
related research on SSRN

Paper statistics

Downloads
44
Abstract Views
463
PlumX Metrics