Three ideas for the quadratic assignment problem

Operations Research

Volumn 60, Issue 4, 2012, Pages 954-964

  Fischetti, Matteo ^a   Monaci, Michele ^a   Salvagnin, Domenico ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING POWER; EXACT SOLUTION; HARD INSTANCES; OPTIMALITY; QUADRATIC ASSIGNMENT PROBLEMS;

OPERATIONS RESEARCH;

COMPUTER APPLICATIONS;

EID: 84866358617     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1120.1073     Document Type: Article

References (28)

1. Adams WP, Johnson TA (1994) Improved linear programming-based lower bounds for the quadratic assignment problem. Proc. DIMACS Workshop on Quadratic Assignment Problems, DIMACS Series in Discrete Math. Theoret. Comput. Sci. Vol. 16, American Mathematical Society, Providence, RI, 43-75.
2. Anstreicher KM (2003) Recent advances in the solution of quadratic assignment problems. Math. Programming 97(1):27-42.
3. Anstreicher KM, Brixius NW, Goux J-P, Linderoth J (2002) Solving large quadratic assignment problems on computational grids. Math. Programming 91(3):563-588. (Pubitemid 44773351)
4. Balas E, Fischetti M (1993) A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Math. Programming 58(1-3):325-352. (Pubitemid 23682586)
5. Burkard RE, Dell'Amico M, Martello S (2009) Assignment Problems (SIAM, Philadelphia).
6. Burkard RE, Karisch S, Rendl F (1991) QAPLIB - A quadratic assignment problem library. Eur. J. Oper. Res. 55(1):115-119. http://www .seas.upenn.edu/qaplib/.
7. Cela E (1998) The Quadratic Assignment Problem: Theory and Algorithms (Kluwer Academic Publishers, Dordrecht, The Netherlands).
8. Christof T (2009) Porta. http://typo.zib.de/opt-long-projects/Software/ Porta/.
9. Clausen J, Perregaard M (1997) Solving large quadratic assignment problems in parallel. Computational Optim. Appl. 8(2):111-127. (Pubitemid 127506125)
10. Darga PT, Katebi H, Liffiton M, Markov I, Sakallah K (2008) Saucy. http://vlsicad.eecs.umich.edu/BK/SAUCY/.
11. de Klerk E, Sotirov R (2010) Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. Math. Programming 122(2):225-246.
12. de Klerk E, Sotirov R (2012) Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry. Math. Programming A. 133(1-2):75-91.
13. Drezner Z (2006) Finding a cluster of points and the grey pattern quadratic assignment problem. OR Spectrum 28(3):417-436. (Pubitemid 44326877)
14. Eschermann B, Wunderlich HJ (1990) Optimized synthesis of self-testable finite state machines. 20th Internat. Sympos. Fault-Tolerant Comput. (FFTCS 20), 390-397.
15. Fischetti M, Monaci M, Salvagnin D (2011) Three ideas for the quadratic assignment problem. CPAIOR 2011, Late breaking abstracts. ZIB report 11-20, 9-13. http://cpaior2011.zib.de/downloads/CPAIOR2011 -abstracts.pdf.
16. Gilmore PC (1962) Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J. Appl. Math. 10(2):305-313.
17. Kaibel V (1998) Polyhedral combinatorics of quadratic assignment problems with less objects than locations. Bixby R, Boyd E, Ríos-Mercado R, eds. Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 1412 (Springer, Berlin), 409-422. (Pubitemid 128093745)
18. Kaufman L, Broeckx F (1978) An algorithm for the quadratic assignment problem using Benders' decomposition. Eur. J. Oper. Res. 2(3):204-211.
19. Koopmans TC, Beckmann MJ (1957) Assignment problems and the location of economic activities. Econometrica 25(1):53-76.
20. Lawler EL (1963) The quadratic assignment problem. Management Sci. 9(4):586-599.
21. Margot F (2002) Pruning by isomorphism in branch-and-cut. Math. Programming 94(1):71-90. (Pubitemid 44744731)
22. McKay BD (2010) Nauty users guide (version 204). Technical report, Department of Computer Science, Australian National University, Canberra, Australia.
23. Nyberg A, Westerlund T (2012) A new exact discrete linear reformulation of the quadratic assignment problem. Eur. J. Oper. Res. 220(2): 314-319.
24. Ostrowski J, Linderoth J, Rossi F, Smriglio S (2011) Orbital branching. Math. Programming 126(1):147-178.
25. Patel J, Chinneck JW (2007) Active-constraint variable ordering for faster feasibility of mixed integer linear programs. Math. Programming 110(3):445-474. (Pubitemid 46862316)
26. Pryor J, Chinneck JW (2011) Faster integer-feasibility in mixed-integer linear programs by branching to force change. Comput. Oper. Res. 38(8):1143-1152.
27. Xia Y, Yuan YX (2006) A new linearization method for quadratic assignment problem. Optim. Methods Software 21(5):803-816.
28. Zhang H, Beltran-Royo C, Ma L (2012) Solving the quadratic assignment problem by means of general purpose mixed integer linear programming. Ann. Oper. Res. 7:1-18.