A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method

European Journal of Operational Research

Volumn 108, Issue 3, 1998, Pages 629-640

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

^a Sci Tech Services   (United States)

^b Bear Stearns & Co Inc   (United States)

^c Flexible Intelligent Technology   (United States)

Author keywords

Branch and bound; Integer programming; Mathematical programming; Quadratic assignment problem; Quadratic programming

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING;

BRANCH AND BOUND ALGORITHM; HUNGARIAN METHOD; LINEAR ASSIGNMENT PROBLEM; QUADRATIC ASSIGNMENT PROBLEM; QUADRATIC PROGRAMMING;

ALGORITHMS;

EID: 0032143777     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00063-5     Document Type: Article

References (27)

1. S. Areibi, A. Vannelli, Advanced search techniques for circuit partitioning, in: P. Pardalos, H. Wolkowicz (Eds.), Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 16 (1994) pp. 77-99.
2. Assad, A.A. and Xu, W.On lower bounds for a class of quadratic 0,1 programs. Oper. Res. Lett.., (Vol. 4) (1985) 175-180.
3. Bazaraa, M.S. and Kirca, O.A branch-and-bound-based heuristic for solving the quadratic assignment problem. Nav. Res. Logist. Q.., (Vol. 30) (1), (1983) 287-304.
4. Burkard, R.E.A heuristic for quadratic Boolean programs with applications to quadratic assignment problems Eur. J. Oper. Res.., (Vol. 13) (1983) 374-386.
5. Burkard, R.E.Quadratic assignment problems. Eur. J. Oper. Res.., (Vol. 15) (3), (1984) 283-289.
6. R.E. Burkard, Locations with spatial interactions: The quadratic assignment problem, in: P.B. Mirchandani, R.L. Francis (Eds.), Discrete Location Theory, John Wiley and Sons, 1991, pp. 387-437.
7. Burkard, R.E., Karisch, S.E. and Rendl, F.QAPLIB - A quadratic assignment problem library. Eur. J. Oper. Res.., (Vol. 55) (99), (1991) 115-119.
8. Carraresi, P. and Malucelli, F.A new lower bound for the quadratic assignment problem. Oper. Res.., (Vol. 40) (1), (1992) S22-S27.
9. J. Clausen, M. Perregaard, Solving large quadratic assignment problems in parallel, Comput. Optim. Appl., June 30, 1995, accepted for publication.
10. Elshafei, A.Hospital layout as a quadratic assignment problem. Oper. Res. Q.., (Vol. 28) (1), (1977) 167-179.
11. Frieze, A.M. and Yadegar, J.On the quadratic assignment problem. Discrete Appl. Math.., (Vol. 5) (1), (1983) 89-98.
12. Gilmore, P.C.Optimal and suboptimal algorithms for the quadratic assignment problem. J. Soc. Ind. Appl. Math.., (Vol. 10) (2), (1962) 305-313.
13. T.L. Grant, An Evaluation and Analysis of the Resolvent Sequence Method for Solving the Quadratic Assignment Problem, Masters Thesis, University of Pennsylvania, 1989.
14. S. Hadley, F. Rendl, H. Wolkowicz, Bounds for the quadratic assignment problem using continuous optimization techniques, in: Integer Programming and Combinatorial Optimization, University of Waterloo Press, 1990, pp. 237-248.
15. P.M. Hahn, Minimization of cost in assignment of codes to data transmission, Ph.D. Dissertation, University of Pennsylvania, 1968.
16. P.M. Hahn, T.L. Grant, Lower bounds for the quadratic assignment problem based upon a dual formulation, Oper. Res. Soc. Am., considered for publication.
17. R.W. House, L.D. Nelson, T. Rado, Computer studies of a certain class of linear integer programs, in: A. Lavi, T.P. Vogl (Eds.), Recent Advances in Optimization Techniques, John Wiley and Sons, 1965.
18. Koopmans, T.C. and Beckmann, M.J.Assignment problems and the location of economic activities. Econometrica., (Vol. 25) (1957) 53-76.
19. Lawler, E.L.The quadratic assignment problem. Manag. Sci.., (Vol. 9) (1963) 586-599.
20. Y. Li, P. Pardalos, M. Resende, A greedy randomized adaptive search procedure for the quadratic assignment problem, DIMACS Ser. Discrete Math. Theor. Comput. Sci. 16 (1994).
21. Munkres, M.Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math.., (Vol. 5) (1), (1957) 32-38.
22. Nugent, C.E., Vollman, T.E. and Ruml, J.An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res.., (Vol. 16) (1968) 150-173.
23. P.M. Pardalos, J.V. Crouse, A parallel algorithm for the quadratic assignment problem, Proceedings of the 1989 Supercomputing Conference, ACM Press, 1989, pp. 351-360.
24. P.M. Pardalos, K.G. Ramakrishnan, M.G.C. Resende, Y. Li, Implementation of a variance reduction based lower bound in a branch-and-bound algorithm for the quadratic assignment problem, unpublished.
25. Roucairol, C.A reduction method for the quadratic assignment problem. Oper. Res. Verfahren-Methods Oper. Res. ., (Vol. 32) (1979) 185-187.
26. Roucairol, C.A parallel branch-and-bound algorithm for the quadratic assignment problem. Discrete Appl. Math.., (Vol. 18) (2), (1987) 211-225.
27. Sahni, S. and Teogilo, G.P-complete approximation problems. J. Assoc. Comput. Mach.., (Vol. 23) (3), (1976) 555-565.