Variability of Integer Programming Models of Course Timetabling
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F07%3A00048082" target="_blank" >RIV/00216224:14330/07:00048082 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Variability of Integer Programming Models of Course Timetabling
Original language description
In this presentation, we draw upon our experience with integer programming formulations of course timetabling problems from the universities in Udine and Benevento and from the Timetabling Competition 2002. We describe the effects of the choice of decision variables and subsequent implementation of the all different constraint, in addition to the effects of various formulations of constraints which enforce certain patterns in timetables. Some rather striking results are presented, including formulationsyielding optimal solutions of the instance Udine1 within 91 seconds on a single processor.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F07%2F0205" target="_blank" >GA201/07/0205: Dynamic aspects of scheduling</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů