Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem

INFORMS Journal on Computing

Volumn 11, Issue 4, 1999, Pages 358-369

  Maniezzo, Vittorio ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Branch and bound; Quadratic assignment problem; The ant system

Indexed keywords

EID: 0000127689     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.11.4.358     Document Type: Article

References (33)

1. A.A. ASSAD and W. XU, 1985. On Lower Bounds for a Class of Quadratic {0,1} Programs, Operations Research Letters 4, 175-180.
2. R. BATTITI and G. TECCHIOLLI, 1994. The Reactive Tabu Search. ORSA Journal on Computing 6, 126-140.
3. A. BRUNGGER, J. CLAUSEN, A. MARZETTA, and M. PERREGAARD, 1996. Joining Forces in Solving Large-Scale Quadratic Assignment Problems in Parallel, DIKU Technical Report TR-96-23, University of Copenhagen.
4. R.E. BURKARD, 1984. Quadratic Assignment Problems, European Journal of Operational Research 15, 283-289.
5. R.E. BURKARD and U. DERIGS, 1980. Assignment and Matching Problems: Solution Methods with Fortran Programs, Lecture Notes in Economics and Mathematical Systems, Vol. 184, Springer, Berlin.
6. R.E. BURKARD, S.E. KARISCH, and F. RENDL, 1994. QAPLIB - A Quadratic Assignment Problem Library, Technical Report n.287, Technische Universität Graz.
7. P. CARRARESI and F. Malucelli, 1992. A New Lower Bound for the Quadratic Assignment Problem, Operations Research 40, Suppl. 1, S22-S27.
8. E. ÇELA, 1998. The Quadratic Assignment Problem. Kluwer Academic Publishers, Boston.
9. A. COLORNI, M. DORIGO, and V. MANIEZZO, 1991. Distributed Optimization by Ant Colonies, Proceedings of ECAL91 - European Conference on Artificial Life, Paris, France, Elsevier Publishing, Amsterdam, pp. 134-142.
10. D.T. CONNOLLY, 1990. An Improved Annealing Scheme for the QAP, European Journal of Operational Research 46, 93-100.
11. V.-D. CUNG, T. MAUTOR, P. MICHELON, and A. TAVARES, 1997. A Scatter Search Based Approach for the Quadratic Assignment Problem. Proceedings of the IEEE-ICEC'97 Conference, Indianapolis.
12. M. DORIGO, V. MANIEZZO, and A. COLORNI, 1996. Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics 26, 29-41.
13. G. FINKE, R.E. BURKARD, and F. RENDL, 1987. Quadratic Assignment Problems, Annals of Discrete Mathematics 31, 61-82.
14. C. FLEURENT and J.A. FERLAND, 1994. Genetic Hybrids for the Quadratic Assignment Problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, (P.M. Pardalos and H. Wolkowicz, eds.), 173-188.
15. P. GILMORE, 1962. Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem, Journal of SIAM 10, 305-313.
16. F. GLOVER, 1995. Scatter Search and Star-Paths: Beyond the Genetic Metaphor, OR Spectrum 17, 125-137.
17. P. HAHN and T. GRANT, 1998. Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation, Operations Research 46, 912-922.
18. P. HAHN, T. GRANT, and N. HALL, 1998. A Branch and Bound Algorithm for the Quadratic Assignment Problem Based on the Hungarian Method, European Journal of Operational Research 108, 629-640.
19. T.C. KOOPMANS and M.J. BECKMANN, 1957. Assignment Problems and the Location of Economic Activities, Econometrica 25, 53-76.
20. E. LAWLER, 1963. The Quadratic Assignment Problem, Management Science 9, 586-599.
21. Y. LI, P.M. PARDALOS, and M.G.C. RESENDE, 1994. A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment and Related Problem. In P.M. Pardalos and H. Wolkowicz (eds), Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, 237-261.
22. V. MANIEZZO, A. COLORNI, and M. DORIGO, 1994. The Ant System Applied to the Quadratic Assignment Problem. Technical Report IRIDIA/94-28, Université Libre de Bruxelles, Belgium.
23. V. MANIEZZO, A. COLORNI, and M. DORIGO, 1995. Algodesk: An Experimental Comparison of Eight Evolutionary Heuristics Applied to the Quadratic Assignment Problem. European Journal of Operational Research 81, 188-205.
24. V. MANIEZZO and A. COLORNI, 1998. The Ant System Applied to the Quadratic Assignment Problem, IEEE Transactions on Knowledge and Data Engineering, to appear.
25. T. MAUTOR and C. ROUCAIROL, 1993. A New Exact Algorithm for the Solution of Quadratic Assignment Problems, Discrete Applied Mathematics 55, 281-293.
26. A. MINGOZZI, L. BIANCO, and S. RICCIARDELLI, 1997. Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Contraints, Operations Research 45, 365-377.
27. P.M. PARDALOS and J. CROUSE, 1989. A Parallel Algorithm for the Quadratic Assignment Problem, Proceedings of Supercomputing '89, ACM, 351-360.
28. P.M. PARDALOS and H. WOLKOWICZ (eds.), 1994. Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16.
29. F. RENDL and H. WOLKOWICZ, 1992. Applications of Parametric Programming and Eigenvalue Maximization to the Quadratic Assignment Problem, Mathematical Programming 53, 63-78.
30. M.G.C. RESENDE, K.G. RAMAKRISHAN and Z. DREZNER, 1995. Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming, Operations Research 43, 781-791.
31. C. ROUCAIROL, 1987. A Parallel Branch and Bound Algorithm for the Quadratic Assignment Problem, Discrete Applied Mathematics 18, 211-225.
32. E. TAILLARD, 1991. Robust Taboo Search for the Quadratic Assignment Problem, Parallel Computing 17, 443-455.
33. E. TAILLARD, 1995. Comparison of Iterative Searches for the Quadratic Assignment Problem, Location Science 3, 87-105.