Lower bounds for the quadratic assignment problem based upon a dual formulation

Operations Research

Volumn 46, Issue 6, 1998, Pages 912-922

  Hahn, Peter ^a,b   Grant, Thomas ^c  

^a Sci Tech Services Inc   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c Bear Stearns & Co Inc   (United States)

Author keywords

Integer programming: bounding method for Quadratic Assignment Problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; LINEAR PROGRAMMING; MATRIX ALGEBRA; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

DUAL PROCEDURE; LINEAR ASSIGNMENT PROBLEM; LOWER BOUNDS; QUADRATIC ASSIGNMENT PROBLEM;

OPTIMIZATION;

EID: 0032201668     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.46.6.912     Document Type: Article

References (30)

1. ADAMS, W. P. AND T. JOHNSON. 1994. Improved Linear Programming-based Lower Bounds for the Quadratic Assignment Problem. DIMACS Series in Discrete Math. and Theoretical Comp. Science. 16, 43-76.
2. ADAMS, W. P. AND H. D. SHERALI. 1986. A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems. Mgmt. Sci. 32, 1274-1290.
3. ASSAD, A. A. AND W. XU. 1985. On Lower Bounds for a Class of Quadratic 0,1 Programs. O.R. Lett. 4, 175-180.
4. BAZARAA, M. S. AND O. KIRCA. 1983. A Branch-and-Bound-Based Heuristic for Solving the Quadratic Assignment Problem. Naval Res. Logist. Quart. 30, 287-304.
5. BURKARD, R. E. 1991. Locations with Spatial Interactions: The Quadratic Assignment Problem. Discrete Location Theory. P. B. Mirchandani and R. L. Francis, eds. John Wiley & Sons, 387-437.
6. BURKARD, R. E. AND T. BONNIGER. 1983. A Heuristic for Quadratic Boolean Programs with Applications to Quadratic Assignment Problems. Euro. J. Opnl. Res. 13, 374-386.
7. BURKARD, R. E., S. E. KARISCH AND F. RENDL. 1991. QAPLIB - A Quadratic Assignment Problem Library. Euro. J. Opnl. Res. 55, 115-119.
8. BURKARD, R. E. AND K. H. STRATMANN. 1978. Numerical Investigations on Quadratic Assignment Problems. Naval Res. Logist. Quart. 25, 129-148.
9. CARRARESI, P. AND F. MALUCELLI. 1992. A New Lower Bound for the Quadratic Assignment Problem. Opns. Res. 40, Suppl., S22-S27.
10. CLAUSEN, J. AND M. PERREGAARD. 1997. Solving Large Quadratic Assignment Problems in Parallel. DIKU, Department of Computer Science, University of Copenhagen, June 30. Computational Optimization and Applications 8, 111-128.
11. EDWARDS, C. S. 1980. A Branch-and-Bound Algorithm for the Koopmans-Beckmann Quadratic Assignment Problem. Math. Prog. Study. 13, 35-52.
12. ELSHAFEI, A. 1977. Hospital Layout as a Quadratic Assignment Problem. Opns. Res. Quart. 28, no. 1 167-179.
13. FRIEZE, A. M. AND J. YADEGAR. 1983. On the Quadratic Assignment Problem. Discrete Applied Math. 5, 89-98.
14. GILMORE, P. C. 1962. Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem. J. Society for Industrial and Applied Math. 10, 305-313.
15. 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, PA.
16. HADLEY, S., F. RENDL AND H. WOLKOWCZ. 1990. Bounds for the Quadratic Assignment Problem Using Continuous Optimization Techniques. Integer Programming and Combinatorial Optimization. University of Waterloo Press, Waterloo, Ontario, Canada, 237-248.
17. HAHN, P. M. 1968. Minimization of Cost in Assignment of Codes to Data Transmission. Ph.D. Dissertation, University of Pennsylvania, Philadelphia, PA.
18. HAHN, P. M., T. L. GRANT AND N. HALL. 1998. Solution of the Quadratic Assignment Problem Using the Hungarian Method. Euro. J. Opnl. Res. 108, 629-640.
19. HOUSE, R. W., L. D. NELSON AND T. RADO. 1965. Computer Studies of a Certain Class of Linear Integer Programs. Recent Advances in Optimization Techniques. A. Lavi and T. P. Vogl, eds. John Wiley and Sons, New York.
20. JOHNSON, T. A. 1992. New Linear Programming-Based Solution Procedures for the Quadratic Assignment Problem. Ph.D. Dissertation, Clemson University, Clemson, SC.
21. KAKU, B. K. AND G. L. THOMPSON. 1986. An Exact Algorithm for the General Quadratic Assignment Problem. Euro. J. Opnl. Res. 23, 382-390.
22. KARISCH, S. E. AND F. RENDL. 1995. Lower Bounds for the Quadratic Assignment Problem via Triangle Decomposition. Math. Prog. 71, 137-152.
23. KOOPMANS, T. C. AND M. J. BECKMANN. 1957. Assignment Problems and the Location of Economic Activities. Econometrica. 25, 53-76.
24. LAWLER, E. L. 1963. The Quadratic Assignment Problem. Management Sci. 9, 586-599.
25. LI, Y., P. PARDALOS AND M. RESENDE. 1994. A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem. DIMACS Series in Discrete Math. and Theoretical Comp. Sci. 16, 237-263.
26. LI, Y., P. PARDALOS, K. G. RAMAKRISHNAM AND M. G. RESENDE. 1994. Lower Bounds for the Quadratic Assignment Problem. Annals of Operations Res. 50, 387-410.
27. MUNKRES, M. 1957. Algorithms for the Assignment and Transportation Problems. J. of the Society for Industrial and Applied Math. 5, 32-38.
28. NUGENT, C. E., T. E. VOLLMAN AND J. RUML. 1968. An Experimental Comparison of Techniques for the Assignment of Facilities to Locations. Opns. Res. 16, 150-173.
29. RESENDE, M. G. C., K. G. RAMAKRISHNAN AND Z. DREZNER. 1995. Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming. Opns. Res. 43, 781-791.
30. ROUCAIROL, C. 1979. A Reduction Method for Quadratic Assignment Problems. Opns. Res. Verfahren. 32, 183-187.