A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem

INFORMS Journal on Computing

Volumn 24, Issue 2, 2012, Pages 202-209

  Hahn, Peter M ^a   Zhu, Yi Rong ^b   Guignard, Monique ^c   Hightower, William L ^d   Saltzman, Matthew J ^e  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Elder Research Inc   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

^d HIGH POINT UNIVERSITY   (United States)

^e CLEMSON UNIVERSITY   (United States)

Author keywords

Dual ascent; Exact solution; QAP; Quadratic assignment; Reformulation linearization; RLT

Indexed keywords

DUAL ASCENT; EXACT SOLUTION; QAP; QUADRATIC ASSIGNMENT; REFORMULATION-LINEARIZATION; RLT;

ALGORITHMS;

EID: 84862009363     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1110.0450     Document Type: Article

References (19)

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