Penalising Patterns in Timetables: Novel Integer Programming Formulations
by
Edmund K. Burke
,
Jakub Mareček
,
Andrew J. Parkes
,
Hana Rudová
| Citations: | 2 - 2 self |
BibTeX
@MISC{Burke_penalisingpatterns,
author = {Edmund K. Burke and Jakub Mareček and Andrew J. Parkes and Hana Rudová},
title = {Penalising Patterns in Timetables: Novel Integer Programming Formulations},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Many complex timetabling problems, such as employee rostering [1] and university course timetabling [2, 3], have an underpinning bounded graph colouring component, a pattern penalisation component and a number of side constraints. The bounded graph colouring component
