A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem

References

• Adams W. P., Johnson T. A., Pardalos P. M., Wolkowicz H. Improved linear programming-based lower bounds for the quadratic assignment problem. Quadratic Assignment and Related Problems, Vol. 16. (1994) (American Mathematical Society, Providence, RI) 43–75DIMACS Series in Discrete Mathematics and Theoretical Computer ScienceCrossref, Google Scholar
• Adams W. P., Sherali H. D. A tight linearization and an algorithm for zero-one quadratic programming problems. Management Sci. (1986) 32(10):1274–1290Link, Google Scholar
• Adams W. P., Sherali H. D. Linearization strategies for a class of zero-one mixed integer programming problems. Oper. Res. (1990) 38(2):217–226Link, Google Scholar
• Adams W. P., Guignard M., Hahn P. M., Hightower W. L. A level-2 reformulation-linearization technique bound for the quadratic assignment problem. Eur. J. Oper. Res. (2007) 180(3):983–996Crossref, Google Scholar
• Anstreicher K. M., Brixius N. W. A new bound for the quadratic assignment problem based on convex quadratic programming. Math. Programming (2001) 89(3):341–357Crossref, Google Scholar
• Burer S., Vandenbussche D. Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. (2006) 16(3):726–750Crossref, Google Scholar
• Grant T. L. An evaluation and analysis of the resolvent sequence method for solving the quadratic assignment problem. (1989) . Master's thesis, University of Pennsylvania, PhiladelphiaGoogle Scholar
• Hahn P. M. Minimization of cost in assignment of codes to data transmission. (1968) . Ph.D. dissertation, University of Pennsylvania, PhiladelphiaGoogle Scholar
• Hahn P. M., Grant T. L. Lower bounds for the quadratic assignment problem based upon a dual formulation. Oper. Res. (1998) 46(6):912–922Link, Google Scholar
• Karisch S. E., Çela E., Clausen J., Espersen T. A dual framework for lower bounds of the quadratic assignment problem based on linearization. Computing (1999) 63(4):351–403Crossref, Google Scholar
• Loiola E. M., de Abreu N. M. M., Boaventura-Netto P. O., Hahn P. M., Querido T. A survey for the quadratic assignment problem. Eur. J. Oper. Res. (2007) 176(2):657–690Crossref, Google Scholar
• QAPLIB QAPLIB home page. (2004) . Retrieved March 27, 2011, http://www.seas.upenn.edu/qaplib/Google Scholar
• Ramakrishnan K. G., Resende M. G. C., Ramachandran B., Pekny J. F., Pardalos P. M., Migdalas A., Burkard R. E. Tight QAP bounds via linear programming. Combinatorial and Global Optimization (2002) (World Scientific Publishing, Singapore) 297–303Crossref, Google Scholar
• Rendl F., Sotirov R. Bounds for the quadratic assignment problem using the bundle method. Math. Programming (2007) 109(2):505–524Crossref, Google Scholar
• Resende M. G. C., Ramakrishnan K. G., Drezner Z. Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Oper. Res. (1995) 43(5):781–791Link, Google Scholar
• Roupin F. From linear to semidefinite programming: An algorithm to obtain semidefinite relaxations for bivalent quadratic problems. J. Combin. Optim. (2004) 8(4):469–493Crossref, Google Scholar
• Sherali H. D., Adams W. P. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. (1990) 3(3):411–430Crossref, Google Scholar
• Sherali H. D., Adams W. P. A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. (1994) 52(1):83–106Crossref, Google Scholar
• Zhu Y.-R. Recent advances and challenges in the quadratic assignment and related problems. (2007) . Ph.D. dissertation, ESE Department, University of Pennsylvania, PhiladelphiaGoogle Scholar