1. Aubin, J. and Ferland, J.A., “A Large Scale Timetabling Problem”, Computers & Operations Research 16, 67–77, 1989.
2. E.K. Burke and J.P. Newall, “A Multi-Stage Evolutionary Algorithm for the Timetable Problem”, the IEEE Transactions on Evolutionary Computation, Vol 3.1, 63–74, 1999
3. Carter, M.W., “A Lagrangian Relaxation Approach to the Classroom Assignment Problem”, INFOR 27, No. 2, pp. 230–246, 1989.
4. Carter, M.W., “A Decomposition Algorithm for Practical Timetabling Problems”, Working Paper, Mechanical and Industrial Engineering, University of Toronto, 1983 (available from
www.mie.utoronto.ca/staff/profiles/carter.html
)
5. Carter, M.W., and Gendreau, M., “A Practical Algorithm to Find a Large Clique in a Graph”, Working Paper, Mechanical and Industrial Engineering, University of Toronto, 1999.