A survey of practical applications of examination timetabling algorithms
Operations Research
Integer and combinatorial optimization
Integer and combinatorial optimization
Solving airline crew scheduling problems by branch-and-cut
Management Science
An exact algorithm for the maximum stable set problem
Computational Optimization and Applications
A Survey of Automated Timetabling
Artificial Intelligence Review
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Computer-Aided School and University Timetabling: The New Wave
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Recent Developments in Practical Examination Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Scheduling, Timetabling and Rostering - A Special Relationship?
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Building University Timetables Using Constraint Logic Programming
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Memetic Algorithm for University Exam Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Extensions to a Memetic Timetabling System
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Recent Developments in Practical Course Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
A MAX-MIN Ant System for the University Course Timetabling Problem
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Journal of Heuristics
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
The university course timetabling problem with a three-phase approach
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Minimal perturbation problem in course timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
School timetabling for quality student and teacher schedules
Journal of Scheduling
Decomposition, reformulation, and diving in university course timetabling
Computers and Operations Research
Timetabling problems at the TU eindhoven
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Term-end exam scheduling at United States Military Academy/West Point
Journal of Scheduling
Complex university course timetabling
Journal of Scheduling
| Hi-index | 0.00 |
In this paper, we describe a case-study where a Branch-and-Cut algorithm yields the "optimal" solution of a real-world timetabling problem of University courses (University Course Timetabling problem).The problem is formulated as a Set Packing problem with side constraints. To tighten the initial formulation, we utilize well-known valid inequalities of the Set Packing polytope, namely Clique and Lifted Odd-Hole inequalities. We also analyze the combinatorial properties of the problem to introduce new families of cutting planes that are not valid for the Set Packing polytope, and their separation algorithms. These cutting planes turned out to be very effective to yield the optimal solution of a set of real-world instances with up to 69 courses, 59 teachers, and 15 rooms.