Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry

Mathematical Programming

Volumn 133, Issue 1-2, 2012, Pages 75-91

  De Klerk, Etienne ^a   Sotirov, Renata ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

Branch and bound; Group symmetry; Quadratic assignment problem; Semidefinite programming

Indexed keywords

AUTOMORPHISM GROUPS; BRANCH AND BOUNDS; DATA MATRICES; GROUP SYMMETRIES; LOWER BOUNDS; MATH PROGRAMS; QUADRATIC ASSIGNMENT PROBLEMS; SEMI-DEFINITE PROGRAMMING;

LINEAR PROGRAMMING;

MATRIX ALGEBRA;

EID: 84862298761     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0411-5     Document Type: Article

References (25)

1. K.M. Anstreicher 2003 Recent advances in the solution of quadratic assignment problems Math. Program. Ser. B 97 27 42 2004391 1035.90067
2. G. Ben-David D. Malah 2005 Bounds on the performance of vector quantizers under channel errors IEEE Trans. Inf. Theory 51 6 2227 2235 2235298 10.1109/TIT.2005.847750
3. S. Burer D. Vandenbussche 2006 Solving lift-and-project relaxations of binary integer programs SIAM J. Optim. 16 726 750 2197554 10.1137/040609574 1113.90100
4. Burkard, R.E,; Karisch, S.E,; Rendl, F.: QAPLIB-a quadratic assignment problem library. J. Glob. Optim. 10, 291-403 (1997). see also http://www.seas.upenn.edu/qaplib/
5. Cameron P.J.: Permutation Groups. Cambridge University Press, Cambridge (1999)
6. T. Christof M. Jünger G. Reinelt 1991 A complete description of the traveling salesman polytope on 8 nodes Oper. Res. Lett. 10 497 500 1159049 10.1016/0167-6377(91)90067-Y 0744.90070
7. B. Eschermann 1993 State assignment for hardwired VLSI control units ACM Comput. Surv. 25 4 415 436 10.1145/162124.162132
8. 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-28th June (1990)
9. Gijswijt, D.: Matrix algebras and semidefinite programmming techniques for Codes. PhD Thesis. University of Amsterdam, The Netherlands (2005)
10. E. de Klerk R. Sotirov 2010 Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem Math. Program. A 122 2 225 246 10.1007/s10107-008-0246-5 1184.90120
11. E. de Klerk D.V. Pasechnik R. Sotirov 2008 On semidefinite programming relaxations of the traveling salesman problem SIAM J. Optim. 19 4 1559 1573 2486040 10.1137/070711141 1196.90094
12. K. Gatermann P.A. Parrilo 2004 Symmetry groups, semidefinite programs, and sum of squares J. Pure Appl. Algebra 192 95 128 2067190 10.1016/j.jpaa.2003. 12.011 1108.13021
13. Graham A.: Kronecker products and matrix calculus with applications. Ellis Horwood Limited, Chichester (1981)
14. L.H. Harper 1964 Optimal assignments of numbers to vertices SIAM J. Sci. Ind. Appl. Math. 12 1 131 135 162737 10.1137/0112012 0222.94004
15. M. Held R.M. Karp 1970 The traveling salesman problem and minimum spanning trees Oper. Res. 18 1138 1162 278710 10.1287/opre.18.6.1138 0226.90047
16. 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
17. Mittelmann, H,; Peng, J.: Estimating bounds for quadratic assignment problems associated with hamming and manhattan distance matrices based on semidefinite programming. SIAM J. Optim. (submitted, 2008)
18. Ostrowski, J,; Linderoth, J,; Rossi, F,; Smiriglio, S.: Orbital branching. Math. Program. A (accepted 2009)
19. L.C. Potter D.M. Chiang 1995 Minimax nonredundant channel coding IEEE Trans. Commun. 43 2/3/4 804 811 10.1109/26.380112 1159.94352
20. J. Povh F. Rendl 2009 Copositive and semidefinite relaxations of the quadratic assignment problem Discrete Optim. 6 3 231 241 2532462 10.1016/j.disopt.2009.01.002 1167.90597
21. A. Schrijver 2005 New code upper bounds from the Terwilliger algebra IEEE Trans. Inf. Theory 51 2859 2866 2236252 10.1109/TIT.2005.851748
22. J.F. Sturm 1999 Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones Optim. Methods Softw. 11-12 625 653 1778433 10.1080/10556789908805766
23. J.H.M. Wedderburn 1907 On hypercomplex numbers Proc. Lond. Math. Soc. 6 2 77 118
24. Wedderburn J.H.M.: Lectures on matrices, vol. 17. AMS Colloquium Publications, AMS publishers, USA (1934)
25. Q. Zhao S.E. Karisch F. Rendl H. Wolkowicz 1998 Semidefinite Programming Relaxations for the Quadratic Assignment Problem J. Comb. Optim. 2 71 109 1616871 10.1023/A:1009795911987 0904.90145