A graph-based MIP formulation of the International Timetabling Competition 2019
- 11 March 2022
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 25 (4) , 405-428
Abstract
No abstract availableKeywords
Funding Information
- Innovationsfonden (8090-00052)
This publication has 13 references indexed in Scilit:
- The Third International Timetabling CompetitionAnnals of Operations Research, 2013
- A branch-and-cut procedure for the Udine Course Timetabling problemAnnals of Operations Research, 2011
- A supernodal formulation of vertex colouring with applications in course timetablingAnnals of Operations Research, 2010
- Decomposition, reformulation, and diving in university course timetablingComputers & Operations Research, 2010
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling CompetitionINFORMS Journal on Computing, 2010
- Penalising Patterns in Timetables: Novel Integer Programming Formulations2008
- Data Reduction, Exact, and Heuristic Algorithms for Clique Cover2006
- The complexity of timetable construction problems1996
- Covering edges by cliques with regard to keyword conflicts and intersection graphsCommunications of the ACM, 1978
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973