A revised reformulation-linearization technique for the quadratic assignment problem

Lawler, 1963, The quadratic assignment problem, Manage. Sci., 9, 586, 10.1287/mnsc.9.4.586 Koopmans, 1957, Assignment problems and the location of economic activities, Econometrica, 53, 10.2307/1907742 Steinberg, 1961, The backboard wiring problem: a placement algorithm, SIAM Rev., 3, 37, 10.1137/1003003 Pollatschek, 1976, Optimization of the typewriter keyboard by simulation, Angew. Inform., 17, 438 Geoffrion, 1976, Scheduling parallel production lines with changeover costs: Practical application of a quadratic assignment/LP approach, Oper. Res., 24, 595, 10.1287/opre.24.4.595 Polak, 2005, On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices, Ann. Oper. Res., 138, 223, 10.1007/s10479-005-2455-0 Loiola, 2007, A survey for the quadratic assignment problem, European J. Oper. Res., 176, 657, 10.1016/j.ejor.2005.09.032 Frieze, 1983, On the quadratic assignment problem, Discrete Appl. Math., 5, 89, 10.1016/0166-218X(83)90018-5 Carraresi, 1992, A new lower bound for the quadratic assignment problem, Oper. Res., 40, S22, 10.1287/opre.40.1.S22 Carraresi, 1994, A reformulation scheme and new lower bounds for the QAP, 147 Adams, 1994, Improved linear programming-based lower bounds for the quadratic assignment problem, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 16, 43, 10.1090/dimacs/016/02 Karisch, 1999, A dual framework for lower bounds of the quadratic assignment problem based on linearization, Computing, 63, 351, 10.1007/s006070050040 Hahn, 1998, Lower bounds for the quadratic assignment problem based upon a dual formulation, Oper. Res., 46, 912, 10.1287/opre.46.6.912 Anstreicher, 2001, A new bound for the quadratic assignment problem based on convex quadratic programming, Math. Program., 89, 341, 10.1007/PL00011402 Adams, 2007, A level-2 reformulation-linearization technique bound for the quadratic assignment problem, European J. Oper. Res., 180, 983, 10.1016/j.ejor.2006.03.051 Hahn, 2012, A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem, INFORMS J. Comput., 24, 202, 10.1287/ijoc.1110.0450 Adams, 1986, A tight linearization and an algorithm for zero–one quadratic programming problems, Manag. Sci., 32, 1274, 10.1287/mnsc.32.10.1274 Adams, 1990, Linearization strategies for a class of zero–one mixed integer programming problems, Oper. Res., 38, 217, 10.1287/opre.38.2.217 Adams, 2004, Comparisons and enhancement strategies for linearizing mixed 0–1 quadratic programs, Discrete Optim., 1, 99, 10.1016/j.disopt.2004.03.006 Resende, 1995, Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming, Oper. Res., 43, 781, 10.1287/opre.43.5.781 Ramakrishnan, 2002, Tight QAP bounds via linear programming, 297 Zhu, 2007 Burkard, 1997, QAPLIB—a quadratic assignment problem library, J. Global Optim., 10, 391, 10.1023/A:1008293323270 Drugan, 2013, Generating QAP instances with known optimum solution and additively decomposable cost function, J. Comb. Optim., 1