Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

References

• Battiti R., Tecchiolli G. The reactive tabu search. ORSA J. Comput. (1994) 6:126–140Link, Google Scholar
• Burkard R. E., Karish S. E., Rendl F. QAPLIB—A quadratic assignment problem library. (1994) . www.opt.math.tugraz.at/~karisch/qaplibGoogle Scholar
• Chaprakani J., Skorin-Kapov J. Massively parallel tabu search for the quadratic assignment problem. Ann. Oper. Res.41:327–341Google Scholar
• Dell'amico M., Trubian M. Solution of large weighted equicut problems. Eur. J. Oper. Res.To appearGoogle Scholar
• Feo T. A., Resende M. G. C., Smith S. A greedy randomized adaptive search procedure for the maximum independent set problem. Oper. Res. (1993) . To appearGoogle Scholar
• Feo T. A., Resende M. G. C. Greedy randomized adaptive search procedures. (1994) . Technical report, AT&T Labs, New JerseyGoogle Scholar
• Fleurent C., Ferland J. A. Genetic hybrids for the quadratic assignment problem. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. (1994) 16:173–188Crossref, Google Scholar
• Glover F. Heuristics for integer programming using surrogate constraints. Decision Sci. (1977) 8:156–166Crossref, Google Scholar
• Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. (1986) 13:533–549Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Hingham, MA) Crossref, Google Scholar
• Glover F., Lokketangen A. Probabilistic tabu search for zero-one mixed integer programming problems. . Technical report, University of Colorado at BoulderGoogle Scholar
• Kirkpatrick S., Gelatt C. D., Vecchi M. P. Optimization by simulated annealing. Science (1983) 220:671–680Crossref, Google Scholar
• Li Y., Pardalos P. M., Resende M. G. C. A greedy randomized adaptive search procedure for the quadratic assignment problem. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. (1994) 16:237–261Crossref, Google Scholar
• Pardalos P. M., Rendl F., Wolkowicz H. The quadratic assignment problem: A survey and recent developments. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. (1994) 16:1–42Crossref, Google Scholar
• Resende M. G. C., Feo T. A. A GRASP for satisfiability. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. (1996) 26:499–520Crossref, Google Scholar
• Resende M. G. C., Pardalos P. M., Li Y. Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. (1994) . Technical report, AT&T Labs, New JerseyGoogle Scholar
• Taillard E. D.Comparison of iterative searches for the quadratic assignment problem. Publication CRT-989 Centre de recherche sur les transports, MontrealGoogle Scholar