Optimal university course timetables and the partial transversal polytope

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5038 LNCS, Issue , 2008, Pages 235-248

  Lach, Gerald ^a   Lübbecke, Marco E ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Integer programming; Partial transversal polytope; University course timetabling

Indexed keywords

ALGORITHMS; EVOLUTIONARY ALGORITHMS; INTERNET; INTERNET PROTOCOLS;

COMPUTATIONAL RESULTS; DECOMPOSITION APPROACH; EXPERIMENTAL ALGORITHMS; HARD CONSTRAINTS; HEIDELBERG (CO); INTEGER PROGRAMS; INTERNATIONAL (CO); POLYMATROID; POLYTOPE; REAL WORLD; SOFT CONSTRAINTS; SPRINGER (CO); TIME SLOT (TS); TIMETABLING; UNIVERSITY COURSES; VALID INEQUALITIES;

INTEGER PROGRAMMING;

EID: 45449087055     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68552-4_18     Document Type: Conference Paper

References (19)

1. Burke, E., Rudová, H. (eds.): PATAT 2006: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Berlin. Lect. Notes Comp. Science. Springer, Heidelberg (2007), http://patat06.muni.cz/proceedings.html
2. Burke, E., Jackson, K., Kingston, J.H., Weare, R.: Automated university timetabling: The state of the art. Comput. J. 40(9), 565-571 (1997)
3. Lovász, L., Plummer, M.D.: Matching Theory, p. 544. North-Holland, Amsterdam (1986)
4. Schrijver, A.: Combinatorial Optimization Polyhedra and Efficiency. Springer, Berlin (2003)
5. ITC2007: 2nd International Timetabling Competition, http://www.cs.qub.ac. uk/itc2007
6. Burke, E.K., Petrovic, S.: Recent research directions in automated timetabling. European J. Oper. Res. 140(2), 266-280 (2002)
7. Schaerf, A.: A survey of automated timetabling. Artificial Intelligence Review 13(2), 87-127 (1999)
8. Daskalaki, S., Birbas, T., Housos, E.: An integer programming formulation for a case study in university timetabling. European J. Oper. Res. 153, 117-135 (2004)
9. Schimmelpfeng, K., Helber, S.: Application of a real-world university-course timetabling model solved by integer programming. OR Spectrum 29, 783-803 (2007)
10. Lewis, R.: A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum (in press, 2007)
11. Meyers, C., Orlin, J.B.: Very large-scale neighborhood search techniques in timetabling problems. In: PATAT 2006: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Berlin, pp. 36-52. springer, Heidelberg (2007)
12. Carter, M.: A comprehensive course timetabling and student scheduling system at the university of Waterloo. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 64-82. Springer, Heidelberg (2001)
13. Daskalaki, S., Birbas, T.: Efficient solutions for a university timetabling problem through integer programming. European J. Oper. Res. 127(1), 106-120 (2005)
14. Qualizza, A., Serafini, P.: A column generation scheme for faculty timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 161-173. Springer, Heidelberg (2005)
15. Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. Standards 69B, 125-130 (1965)
16. Balas, E., Pulleyblank, W.: The perfectly matchable subgraph polytope of a bipartite graph. Networks 13, 495-516 (1983)
17. Lach, G., Lübbecke, M.: Curriculum based course timetabling: Optimal solutions to the Udine benchmark instances. Preprint 2008/9, Technische Universität Berlin, Institut für Mathematik (2008)
18. Lach, G.: Modelle und Algorithmen zur Optimierung der Raumvergabe der TU Berlin. Master's thesis, Technische Universität Berlin, Institut für Mathematik (in German, 2007)
19. Grinstead, C., Snell, J.: Introduction to Probability, 2nd edn. American Mathematical Society, Providence, RI (2003), http://math.dartmouth.edu/ ∼prob/prob/prob.pdf