A branch-and-cut procedure for the Udine Course Timetabling problem
Year of publication: |
2012
|
---|---|
Authors: | Burke, Edmund K. ; Mareček, Jakub ; Parkes, Andrew J. ; Rudová, Hana |
Published in: |
Annals of operations research. - Dordrecht, The Netherlands : Springer Nature B.V., ISSN 0254-5330, ZDB-ID 252629-3. - Vol. 194.2012, p. 71-87
|
Subject: | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | USA | United States | Theorie | Theory |
-
Extended formulations in combinatorial optimization
Conforti, Michele, (2010)
-
Bi-objective green ride-sharing problem : model and exact method
Yu, Yang, (2019)
-
Decision support system of truck routing and refueling : a dual-objective approach
Suzuki, Yoshinori, (2013)
- More ...
-
A supernodal formulation of vertex colouring with applications in course timetabling
Burke, Edmund K., (2010)
-
Penalising patterns in timetables : novel integer programming formulations
Burke, Edmund K., (2008)
-
Decomposition, reformulation, and diving in university course timetabling
Burke, Edmund K., (2010)
- More ...