BURKE, Edmund K., Jakub MAREČEK, Andrew J. PARKES and Hana RUDOVÁ. A Branch-and-Cut Procedure for the Udine Course Timetabling Problem. In Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling. 2008.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name A Branch-and-Cut Procedure for the Udine Course Timetabling Problem
Name in Czech Metoda větví a řezů pro rozvrhovací problém z Udine
Authors BURKE, Edmund K. (826 United Kingdom of Great Britain and Northern Ireland), Jakub MAREČEK (203 Czech Republic, guarantor, belonging to the institution), Andrew J. PARKES (826 United Kingdom of Great Britain and Northern Ireland) and Hana RUDOVÁ (203 Czech Republic, belonging to the institution).
Edition Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling, 2008.
Other information
Original language English
Type of outcome Presentations at conferences
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Canada
Confidentiality degree is not subject to a state or trade secret
WWW URL
RIV identification code RIV/00216224:14330/08:00041927
Organization unit Faculty of Informatics
Keywords in English integer programming; branch-and-cut; cutting planes; soft constraints; educational timetabling; university course timetabling
Tags branch-and-cut, cutting planes, educational timetabling, integer programming, soft constraints, university course timetabling
Tags International impact, Reviewed
Changed by Changed by: doc. Mgr. Hana Rudová, Ph.D., učo 3840. Changed: 2/5/2011 08:33.
Abstract
This paper describes a branch-and-cut procedure for a curriculum-based university course timetabling. First, we present an alternative integer programming formulation for this problem, which uses a lower than usual number of variables and a number of constraints exponential in the number of periods per day necessary to reach optimality. Second, we present a branch-and-cut procedure, where constraints from enumeration of event/free-period patterns, necessary to reaching optimality, are added only when they are violated. We also describe further problem-specific cuts from bounds implied by the soft constraints, cuts from patterns given by days of instruction and free days, and all related separation routines. We also discuss applicability of standard cuts for the graph colouring and weighted matching. The results of our preliminary experimentation with an implementation using ILOG Concert and CPLEX 10 are provided.
Abstract (in Czech)
Práce popisuje řešení rozvrhovacího problému z univerzity v Udine metodou větví a mezí se za běhu generovanými řeznými rovinami (branch-and-cut).
Links
GA201/07/0205, research and development projectName: Dynamické aspekty rozvrhování
Investor: Czech Science Foundation, Dynamic Aspects of Scheduling
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
PrintDisplayed: 27/5/2024 20:55