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

Authors:
Etienne de Klerk;Renata Sotirov
Affiliations:
Tilburg University, Department of Econometrics and OR, Tilburg, The Netherlands;Tilburg University, Department of Econometrics and OR, Tilburg, The Netherlands
Venue:
Mathematical Programming: Series A and B
Year:
2009

Citing 0
Cited 6

Semidefinite approximations for quadratic programs over orthogonal matrices

Journal of Global Optimization
On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming

Mathematics of Operations Research
An iterative scheme for valid polynomial inequality generation in binary polynomial programming

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming

SIAM Journal on Optimization
Three Ideas for the Quadratic Assignment Problem

Operations Research
Using symmetry to optimize over the sherali-adams relaxation

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

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: (Burkard et al. in J Global Optim 10:291–403, 1997).