1. T. Achterberg. Constraint Integer Programming. PhD thesis, Berlin, 2007.
2. P. Avella and I. Vasil’ev. A computational study of a cutting plane algorithm for university course timetabling. J. Scheduling, 8(6):497–514, 2005.
3. E. K. Burke, D. de Werra, and J. H. Kingston. Applications to timetabling. In Handbook of Graph Theory, pages 445–474. CRC, London, UK, 2004.
4. E. K. Burke, J. Mareček, A. J. Parkes, and H. Rudová. On a clique-based integer programming formulation of vertex colouring with applications in course timetabling. Technical report, 2007. at http://arxiv.org/abs/0710.3603.
5. E. K. Burke and S. Petrovic. Recent research directions in automated timetabling. European J. Oper. Res., 140(2):266–280, 2002.