In this paper we present a general integer programming-based approach for the minimal perturbation problem (MPP) in university course timetabling. This problem arises when an existing timetable contains hard constraint violations, or infeasibilities, which need to be resolved. The objective is to resolve these infeasibilities while minimising the disruption or perturbation to the remainder of t...
