1. Arntzen, H. and A. Løkketangen, “A tabu search heuristic for a university timetabling problem,” in Proceedings of the Fifth Metaheuristics International Conference, Kyoto, Japan (Aug. 2003).
2. Birattari, M., The Problem of Tuning Metaheuristics, as seen from a Machine Learning Perspective. PhD thesis, Université Libre de Bruxelles, Brussels, Belgium (2004).
3. Birattari, M., “The race package for R. Racing methods for the selection of the best,” Technical Report TR/IRIDIA/2003-37, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium (2003).
4. Birattari, M., T. Stützle, L. Paquete, and K. Varrentrapp, “A Racing algorithm for configuring metaheuristics,” in W. B. Langdon, E. Cantú-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M.A. Potter, A.C. Schultz, J.F. Miller, E. Burke, and N. Jonoska (eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002), pp. 11–18, New York, 2002. Morgan Kaufmann Publishers.
5. Burke, E. K., A. J. Eckersley, B. McCollum, S. Petrovic, and R. Qu., “Analysing similarity in examination timetabling,” in E. K. Burke and M. Trick, Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling. 2004, pp. 557–559.