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

Mathematical Programming

Volumn 122, Issue 2, 2010, Pages 225-246

  De Klerk, Etienne ^a   Sotirov, Renata ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

Group symmetry; Quadratic assignment problem; Semidefinite programming

Indexed keywords

GROUP SYMMETRIES; GROUP SYMMETRY; LOWER BOUNDS; QUADRATIC ASSIGNMENT PROBLEM; QUADRATIC ASSIGNMENT PROBLEMS; SEMIDEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMMING RELAXATIONS;

CONTROL THEORY;

TRAVELING SALESMAN PROBLEM;

EID: 69949096747     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-008-0246-5     Document Type: Article

References (28)

1. K.M. Anstreicher 2003 Recent advances in the solution of quadratic assignment problems Math. Program. Ser. B 97 27 42
2. K.M. Anstreicher N. Brixius J. Linderoth J.-P. Goux 2002 Solving large quadratic assignment problems on computational grids Math. Program. Ser. B 91 563 588
3. B. Borchers 1999 CSDP, a C library for semidefinite programming Optim. Meth. Softw. 11/12 1-4 613 623
4. S. Burer D. Vandenbussche 2006 Solving lift-and-project relaxations of binary integer programs SIAM J. Optim. 16 726 750
5. Eschermann, B., Wunderlich, H.J.: Optimized synthesis of self-testable finite state machines. In: 20th International Symposium on Fault-tolerant Computing (FFTCS 20), Newcastle upon Tyne, 26-28 June 1990
6. Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB-a quadratic assignment problem library. J. Global Optim. 10, 291-403 (1997); see also http://www.seas.upenn.edu/qaplib/
7. n SIAM J. Discr. Math. 20 189 202
8. E. de Klerk D.V. Pasechnik A. Schrijver 2007 Reduction of symmetric semidefinite programs using the regular*-representation Math. Program. B 109 2-3 613 624
9. de Klerk, E., Pasechnik, D.V., Sotirov, R.: On semidefinite programming relaxations of the traveling salesman problem. CentER discussion paper 2007-101, Tilburg University, The Netherlands (2007). Available at: http://arno.uvt.nl/ show.cgi?fid=67481
10. GAP-groups, algorithms, and programming, Version 4.4.9, The GAP group (2006) http://www.gap-system.org
11. K. Gatermann P.A. Parrilo 2004 Symmetry groups, semidefinite programs, and sum of squares J. Pure Appl. Algebra 192 95 128
12. Gijswijt, D.: Matrix algebras and semidefinite programming techniques for codes. PhD Thesis, University of Amsterdam, The Netherlands (2005). http://staff.science.uva.nl/~gijswijt/promotie/thesis.pdf
13. P.C. Gilmore 1962 Optimal and suboptimal algorithms for the quadratic assignment problem SIAM J. Appl. Math. 10 305 31
14. Graham A.: Kronecker products and matrix calculus with applications. Ellis Horwood Limited, Chichester (1981)
15. R. Grone C.R. Johnson E.M. Sá H. Wolkowicz 1984 Positive definite completions of partial Hermitian matrices Lin. Algebra Appl. 58 109 124
16. E. Lawler 1963 The quadratic assignment problem Manage. Sci. 9 586 599
17. L. Lovász A. Schrijver 1991 Cones of matrices and set-functions and 0-1 optimization SIAM J. Optim. 1 2 166 190
18. Peng, J., Mittelmann, H., Wu, X.: Graph modeling for quadratic assignment problem associated with the hypercube. Technical report, Department of IESE, UIUC, Urbana, IL, 61801, USA (2007). Available at Optimization Online
19. Povh, J., Rendl, F.: Copositive and semidefinite relaxations of the quadratic assignment problem. Manuscript (2006). http://www.optimization-online. org/DB-HTML/2006/10/1502.html
20. F. Rendl R. Sotirov 2007 Bounds for the quadratic assignment problem using the bundle method Math Program Ser B 109 2-3 505 524
21. A. Schrijver 1979 A comparison of the Delsarte and Lovász bounds IEEE Trans. Inf. Theory 25 425 429
22. A. Schrijver 2005 New code upper bounds from the Terwilliger algebra IEEE Trans Inf Theory 51 2859 2866
23. Serre J.-P.: Linear representations of finite groups. Graduate texts in mathematics, vol. 42. Springer, New York (1977)
24. J.F. Sturm 1999 Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones Optim. Meth. Softw. 11-12 625 653
25. J.H.M. Wedderburn 1907 On hypercomplex numbers Proc. Lond. Math. Soc. 6 2 77 118
26. Wedderburn, J.H.M.: Lectures on matrices. AMS Colloquium Publications, vol. 17. AMS publishers (1934)
27. Löfberg, J.: YALMIP : A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD conference, Taipei, Taiwan (2004). http://control.ee.ethz.ch/~joloef/yalmip.php
28. Q. Zhao S.E. Karisch F. Rendl H. Wolkowicz 1998 Semidefinite programming relaxations for the quadratic assignment problem J. Combin. Optim. 2 71 109