A Computational Study of a Cutting Plane Algorithm for University Course Timetabling
- 1 December 2005
- journal article
- Published by Springer Science and Business Media LLC in Journal of Scheduling
- Vol. 8 (6), 497-514
- https://doi.org/10.1007/s10951-005-4780-1
Abstract
No abstract availableKeywords
This publication has 43 references indexed in Scilit:
- An integer programming formulation for a case study in university timetablingEuropean Journal of Operational Research, 2004
- The relation of time indexed formulations of single machine scheduling problems to the node packing problemMathematical Programming, 2002
- Complexity of some special types of timetabling problemsJournal of Scheduling, 2002
- University course timetabling using constraint handling rulesApplied Artificial Intelligence, 2000
- Recent developments in practical course timetablingLecture Notes in Computer Science, 1998
- Timetabling for Greek high schoolsJournal of the Operational Research Society, 1997
- Automated University Timetabling: The State of the ArtThe Computer Journal, 1997
- An exact algorithm for the maximum stable set problemComputational Optimization and Applications, 1994
- A MATHEMATICAL PROGRAMMING MODEL FOR FACULTY COURSE ASSIGNMENTSDecision Sciences, 1984
- An integer linear programming model of a school timetabling problemThe Computer Journal, 1969