A Branch-and-cut Procedure for the Udine Course Timetabling Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00058937" target="_blank" >RIV/00216224:14330/12:00058937 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10479-010-0828-5" target="_blank" >http://dx.doi.org/10.1007/s10479-010-0828-5</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10479-010-0828-5" target="_blank" >10.1007/s10479-010-0828-5</a>

Result language
angličtina
Original language name
A Branch-and-cut Procedure for the Udine Course Timetabling Problem
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)