We show in this paper that the integer programming approach is well suited for solving the timetabling problem: the definition of the integer programming model is simple; its implementation is immediate by using, a mathematical programming language and an integer programming solver. The power of the integer programming approach allows us to extend the model in different interesting directions. A novel 0–1 integer programming formulation of the university timetabling problem is presented. The model provides constraints for a number of operational rules and requirements found in most academic institutions.