Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBurke, Edmunden_UK
dc.contributor.authorMaracek, Jakuben_UK
dc.contributor.authorParkes, Andrew Jen_UK
dc.contributor.authorRudova, Hanaen_UK
dc.description.abstractA 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 2007en_UK
dc.relationBurke 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.
dc.rightsThe 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.en_UK
dc.subjectInteger programmingen_UK
dc.subjectCutting planesen_UK
dc.subjectSoft constraintsen_UK
dc.subjectEducational timetablingen_UK
dc.subjectUniversity course timetablingen_UK
dc.subjectAlgorithm Analysis and Problem Complexityen_UK
dc.subjectDiscrete Mathematics in Computer Scienceen_UK
dc.subjectComputer Graphicsen_UK
dc.subjectData Structuresen_UK
dc.subjectNumeric Computingen_UK
dc.titleA branch-and-cut procedure for the Udine Course Timetabling problemen_UK
dc.typeJournal Articleen_UK
dc.rights.embargoreason[a branch-and-cut procedure.pdf] The publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.en_UK
dc.citation.jtitleAnnals of Operations Researchen_UK
dc.type.statusVoR - Version of Recorden_UK
dc.contributor.affiliationComputing Science and Mathematics - Divisionen_UK
dc.contributor.affiliationUniversity of Nottinghamen_UK
dc.contributor.affiliationUniversity of Nottinghamen_UK
dc.contributor.affiliationMasaryk Universityen_UK
rioxxterms.typeJournal Article/Reviewen_UK
local.rioxx.authorBurke, Edmund|en_UK
local.rioxx.authorMaracek, Jakub|en_UK
local.rioxx.authorParkes, Andrew J|en_UK
local.rioxx.authorRudova, Hana|en_UK
local.rioxx.projectInternal Project|University of Stirling|
local.rioxx.filenamea branch-and-cut procedure.pdfen_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

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

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.