Please use this identifier to cite or link to this item:
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: A branch-and-cut procedure for the Udine Course Timetabling problem
Author(s): Burke, Edmund
Maracek, Jakub
Parkes, Andrew J
Rudova, Hana
Contact Email:
Keywords: Integer programming
Cutting planes
Soft constraints
Educational timetabling
University course timetabling
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Computer Graphics
Data Structures
Numeric Computing
Issue Date: Apr-2012
Date Deposited: 1-Jul-2013
Citation: Burke E, Maracek J, Parkes AJ & Rudova H (2012) A branch-and-cut procedure for the Udine Course Timetabling problem. Annals of Operations Research, 194 (1), pp. 71-87.
Abstract: A branch-and-cut procedure for the Udine Course Timetabling problem is described. Simple compact integer linear programming formulations of the problem employ only binary variables. In contrast, we give a formulation with fewer variables by using a mix of binary and general integer variables. This formulation has an exponential number of constraints, which are added only upon violation. The number of constraints is exponential. However, this is only with respect to the upper bound on the general integer variables, which is the number of periods per day in the Udine Course Timetabling problem. A number of further classes of cuts are also introduced, arising from: enumeration of event/free-period patterns; bounds on the numbers of days of instruction; the desire to exploit integrality of the objective function value; the graph colouring component; and also from various implied bounds. An implementation of the corresponding branch-and-cut procedure is evaluated on the instances from Track 3 of the International Timetabling Competition 2007
DOI Link: 10.1007/s10479-010-0828-5
Rights: The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.
Licence URL(s):

Files in This Item:
File Description SizeFormat 
a branch-and-cut procedure.pdfFulltext - Published Version520.2 kBAdobe PDFUnder Permanent Embargo    Request a copy

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.

This item is protected by original copyright

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved

If you believe that any material held in STORRE infringes copyright, please contact providing details and we will remove the Work from public display in STORRE and investigate your claim.