1. Achterberg, T. (2009). SCIP: solving constraint integer programs. Mathematical Programming Computation, 1, 1–41.
2. Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140(2), 266–280.
3. Burke, E. K., Mareček, J., Parkes, A. J., & Rudová, H. (2007). On a clique-based integer programming formulation of vertex colouring with applications in course timetabling. Technical Report NOTTCS-TR-2007-10, The University of Nottingham. arXiv:0710.3603v2 .
4. Burke, E. K., Mareček, J., Parkes, A. J., & Rudová, H. (2008a). A branch-and-cut procedure for the Udine course timetabling problem. In E.K. Burke & M. Gendreau (Eds.), Proceedings of the 7th international conference on the practice and theory of automated timetabling, PATAT 2008, Montréal, CA.
5. Burke, E. K., Mareček, J., Parkes, A. J., & Rudová, H. (2008b). Penalising patterns in timetables: Strengthened integer programming formulations. In J. Kalcsics & S. Nickel (Eds.) Operations research proceedings 2007 (pp. 409–414). Berlin: Springer.