1. Ahuja, R.K., J.B. Orin, and D. Sharma. (2000). “Very Large Scale Neighborhood Search.” International Transactions in Operations Research 7, 301–317.
2. Anagnostopoulos, A., L. Michel, P. Van Hentenryck, and Y. Vergados. (2005). “A Simulated Annealing Approach to the Traveling Tournament Problem.” Journal of Scheduling 9(2), 177–193.
3. Araùjo, A., V. Rebello, C. Ribeiro, and S. Urrutia. (2005). “A Grid Implementation of a GRASP”-ILS Heuristic for the Mirrored Traveling Tournament Problem (Extended Abstract). In Proceedings of the 6th Metaheuristics International Conference (MIC2005), Vienna, Austria, pp. 70–76.
4. Birattari, M. (2004). The Problem of Tuning Metaheuristics as Seen from a Machine Learning Perspective. Ph.D. thesis, Université Libre de Bruxelles, Brussels, Belgium.
5. Birattari, M. (2005). The RACE Pacakge. http://cran.r-project.org/doc/packages/race.pdf.