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

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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 122; no. 2; pp. 225 - 246
Main Authors:	de Klerk, Etienne, Sotirov, Renata
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer-Verlag 01.04.2010 Springer Springer Nature B.V
Subjects:	Applied sciences Assignment problem Calculus of Variations and Optimal Control; Optimization Combinatorics Exact sciences and technology Full Length Paper Libraries Logistics Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Operational research and scientific management Operational research. Management science Quadratic programming Sparsity Studies Symmetry Theoretical Traveling salesman problem 70-08 Semidefinite programming 20Cxx Quadratic assignment problem Group symmetry 90C22 Lower bound Semidefinite relaxation Assignment problem Semi definite programming Quadratic assignment Quadratic programming Location problem Symmetry group Mathematical programming
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!