1. Angel E, Zissimopoulos V (1997) On the hardness of the quadratic assignment problem with metaheuristics. Technical Report, Laboratoire de Recherche en Informatique, University of Paris sud
2. Bachelet V (1999) Métaheuristiques parallèles hybrides: Application au problème d’affectation quadratique. PhD Thesis, Université des Sciences et Technologies de Lille, France, December 1999
3. Boese KD (1995) Cost versus distance in the travelling salesman problem. Technical Report UCLA computer science department, Los Angeles
4. Box GEP, Jenkins GM (1970) Time series analysis, forecasting and control, Holden Day
5. Culberson J (1996) On the futility of blind search. Technical Report 96-19, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada, July 1996