Three Ideas for the Quadratic Assignment Problem

References

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