Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem

References

• Assad A. A., Xu W. On lower bounds for a class of quadratic {0, 1} programs. Oper. Res. Lett. (1985) 4:175–180Crossref, Google Scholar
• Battiti R., Tecchiolli G. The reactive tabu search. ORSA J. Comput. (1994) 6:126–140Link, Google Scholar
• Brungger A., Clausen J., Marzetta A., Perregaard M. Joining forces in solving large-scale quadratic assignment problems in parallel. Technical report TR-96-23 (1996) (University of Copenhagen)Google Scholar
• Burkard R. E. Quadratic assignment problems. Eur. J. Oper. Res. (1984) 15:283–289Crossref, Google Scholar
• Burkard R. E., Derigs U. Assignment and matching problems: Solution methods with fortran programs. Lecture Notes in Economics and Mathematical Systems (1980) 184(Springer, Berlin) Crossref, Google Scholar
• Burkard R. E., Karisch S. E., Rendl F. Qaplib—A quadratic assignment problem library. (1994) . Technical report no. 287, Technische Universität GrazGoogle Scholar
• Carraresi P., Malucelli F. A new lower bound for the quadratic assignment problem. Oper. Res. (1992) 40(Suppl. 1):S22–S27Link, Google Scholar
• Çela E.The Quadratic Assignment Problem (1998) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Colorni A., Dorigo M., Maniezzo V. Distributed optimization by ant colonies. Proc. ECAL91—European Conf. Artificial Life (1991) (Elsevier Publishing, Amsterdam, Paris, France) 134–142Google Scholar
• Connolly D. T. An improved annealing scheme for the QAP. Eur. J. Oper. Res. (1990) 46:93–100Crossref, Google Scholar
• Cung V.-D., Mautor T., Michelon P., Tavares A. A scatter search based approach for the quadratic assignment problem. Proc. IEEE-ICEC'97 Conf. (1997) IndianapolisGoogle Scholar
• Dorigo M., Maniezzo V., Colorni A. Ant system: Optimization by a colony of cooperating agents. IEEE Trans. Systems, Man, Cybernetics—Part B: Cybernetics (1996) 26:29–41Crossref, Google Scholar
• Finke G., Burkard R. E., Rendl F. Quadratic assignment problems. Ann. Discrete Math. (1987) 31:61–82Google Scholar
• Fleurent C., Ferland J. A., Pardalos P. M., Wolkowicz H. Genetic hybrids for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16 (1994) 173–188Crossref, Google Scholar
• Gilmore P. Optimal and suboptimal algorithms for the quadratic assignment problem. J. SIAM (1962) 10:305–313Google Scholar
• Glover F. Scatter search and star-paths: Beyond the genetic metaphor. OR Spectrum (1995) 17:125–137Crossref, Google Scholar
• Hahn P., Grant T. Lower bounds for the quadratic assignment problem based upon a dual formulation. Oper. Res. (1998) 46:912–922Link, Google Scholar
• Hahn P., Grant T., Hall N. A branch and bound algorithm for the quadratic assignment problem based on the hungarian method. Eur. J. Oper. Res. (1998) 108:629–640Crossref, Google Scholar
• Koopmans T. C., Beckmann M. J. Assignment problems and the location of economic activities. Econometrica (1957) 25:53–76Crossref, Google Scholar
• Lawler E. The quadratic assignment problem. Management Sci. (1963) 9:586–599Link, Google Scholar
• Li Y., Pardalos P. M., Resende M. G. C., Pardalos P. M., Wolkowicz H. A greedy randomized adaptive search procedure for the quadratic assignment and related problem. Quadratic Assignment and Related Problems, DIMACS Ser. Discrete Math. Theoretical Comput. Sci. (1994) 16:237–261Crossref, Google Scholar
• Maniezzo V., Colorni A., Dorigo M. The ant system applied to the quadratic assignment problem. (1994) . Technical report IRIDIA/94-28, Université Libre de Bruxelles, BelgiumGoogle Scholar
• Maniezzo V., Colorni A., Dorigo M. Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem. Eur. J. Oper. Res. (1995) 81:188–205Crossref, Google Scholar
• Maniezzo V., Colorni A. The ant system applied to the quadratic assignment problem. IEEE Trans. Knowledge Data Engrg. (1998) . To appearGoogle Scholar
• Mautor T., Roucairol C. A new exact algorithm for the solution of quadratic assignment problems. Discrete Appl. Math. (1993) 55:281–293Crossref, Google Scholar
• Mingozzi A., Bianco L., Ricciardelli S. Dynamic programming strategies for the traveling salesman problem with time window and precedence contraints. Oper. Res. (1997) 45:365–377Link, Google Scholar
• Pardalos P. M., Crouse J. A parallel algorithm for the quadratic assignment problem. Proc. Supercomputing '89, ACM (1989) 351–360Crossref, Google Scholar
• Pardalos P. M., Wolkowicz H. Quadratic assignment and related problems. DIMACS Ser. Discrete Math. Theoretical Comput. Sci. (1994) 16Crossref, Google Scholar
• Rendl F., Wolkowicz H. Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Math. Programming (1992) 53:63–78Crossref, Google Scholar
• Resende M. G. C., Ramakrishan K. G., Drezner Z. Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Oper. Res. (1995) 43:781–791Link, Google Scholar
• Roucairol C. A parallel branch and bound algorithm for the quadratic assignment problem. Discrete Appl. Math. (1987) 18:211–225Crossref, Google Scholar
• Taillard E. Robust taboo search for the quadratic assignment problem. Parallel Comput. (1991) 17:443–455Crossref, Google Scholar
• Taillard E. Comparison of iterative searches for the quadratic assignment problem. Location Sci. (1995) 3:87–105Crossref, Google Scholar