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

European Journal of Operational Research

Volumn 180, Issue 3, 2007, Pages 983-996

  Adams, Warren P ^a   Guignard, Monique ^b   Hahn, Peter M ^b   Hightower, William L ^c  

^a CLEMSON UNIVERSITY   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c HIGH POINT UNIVERSITY   (United States)

Author keywords

Assignment; Branch and bound; Combinatorial optimization; Quadratic assignment problem; Reformulation linearization technique

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; LAGRANGE MULTIPLIERS; LINEARIZATION; OPTIMIZATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; QUADRATIC ASSIGNMENT PROBLEM; REFORMULATION LINEARIZATION TECHNIQUE;

QUADRATIC PROGRAMMING;

EID: 33847058826     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.03.051     Document Type: Article

References (21)

1. Adams W.P., and Johnson T.A. Improved linear programming-based lower bounds for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16 (1994) 43-75
2. Adams W.P., and Sherali H.D. A tight linearization and an algorithm for zero-one quadratic programming problems. Management Science 32 10 (1986) 1274-1290
3. Adams W.P., and Sherali H.D. Linearization strategies for a class of zero-one mixed integer programming problems. Operations Research 38 2 (1990) 217-226
4. Anstreicher K.M., and Brixius N.W. A new bound for the quadratic assignment problem based on convex quadratic programming. Mathematical Programming 89 3 (2001) 341-357
5. Anstreicher K., Brixius N., Goux J.-P., and Linderoth J. Solving large quadratic assignment problems on computational grids. Mathematical Programming 91 3 (2002) 563-588
6. Brixius N.W., and Anstreicher K.M. Solving quadratic assignment problems using convex quadratic programming relaxations. Optimization Methods and Software 16 1-4 (2002) 49-68
7. Burkard R.E., Karisch S.E., and Rendl F. QAPLIB - A quadratic assignment problem library. European Journal of Operational Research 55 99 (1991) 115-119. http://www.seas.upenn.edu/qaplib/ QAPLIB is found on the web at
8. Gilmore P.C. Optimal and suboptimal algorithms for the quadratic assignment problem. Journal of the Society for Industrial and Applied Mathematics. 10 2 (1962) 305-313
9. Hahn P.M. Corrigendum to tree elaboration strategies in branch-and-bound algorithms for solving the quadratic assignment problem. Yugoslav Journal of Operations Research 12 2 (2002) 271-272
10. Hahn P.M., and Grant T.L. Lower bounds for the quadratic assignment problem based upon a dual formulation. Operations Research 46 6 (1998) 912-922
11. Hahn P.M., Grant T.L., and Hall N. A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method. European Journal of Operational Research 108 3 (1998) 629-640
12. Hahn P.M., Hightower W.L., Johnson T.A., Guignard-Spielberg M., and Roucairol C. Tree elaboration strategies in branch-and-bound algorithms for solving the quadratic assignment problem. Yugoslav Journal of Operations Research 11 1 (2001) 41-60
13. Hahn P.M., and Krarup J. A hospital facility problem finally solved. The Journal of Intelligent Manufacturing 12 5/6 (2001) 487-496
14. T.A. Johnson, New Linear Programming-Based Solution Procedures for the Quadratic Assignment Problem. Ph.D. Dissertation, Clemson University, Clemson, SC, 1992.
15. Lawler E.L. The quadratic assignment problem. Management Science 9 4 (1963) 586-599
16. Nugent C.E., Vollman T.E., and Ruml J. An experimental comparison of techniques for the assignment of facilities to locations. Operations Research 16 1 (1968) 150-173
17. Ramakrishnan K.G., Resende M.C.G., Ramachandran B., and Pekny J.F. In: Pardalos P.M., Migdalas A., and Burkard R. (Eds). Tight QAP Bounds via Linear Programming. Combinatorial and Global Optimization (2002), World Scientific Publishing, Singapore 297-303
18. Resende M.G.C., Ramakrishnan K.G., and Drezner Z. Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Operations Research 43 5 (1995) 781-791
19. Sherali H.D., and Adams W.P. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3 3 (1990) 411-430
20. Sherali H.D., and Adams W.P. A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Applied Mathematics 52 1 (1994) 83-106
21. Sherali H.D., and Adams W.P. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems (1999), Kluwer Academic Publishers, Dordrecht/Boston/London