1. Aarts, E. H. L., & Korst, J. (1989). Simulated annealing and Boltzmann machines. New York: Wiley.
2. Birattari, M., Stützle, T., Paquete, L., & Varrentrapp, K. (2002). 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, & N. Jonoska (Eds.), GECCO 2002: proceedings of the genetic and evolutionary computation conference (pp. 11–18). New York: Kaufmann.
3. Burke, E. K., Mareček, J., Parkes, A. J., & Rudová, H. (2012). A branch-and-cut procedure for the Udine course timetabling problem. Annals of Operations Research, 194, 71–87.
4. Castro, C., & Manzano, S. (2001). Variable and value ordering when solving balanced academic curriculum problems. In 6th workshop of the ERCIM working group on constraints.
5. Lecture notes in computer science;C. Castro,2007