A branch-and-cut procedure for the udine course timetabling problem

7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008

Volumn , Issue , 2008, Pages

  Burke, Edmund K ^a   Mareček, Jakub ^a,b   Parkes, Andrew J ^a   Rudová, Hana ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Branch and cut; Cutting planes; Educational timetabling; Integer programming; Soft constraints; University course timetabling

Indexed keywords

SCHEDULING;

BRANCH AND CUT; CUTTING PLANES; SOFT CONSTRAINT; TIMETABLING; UNIVERSITY COURSE TIMETABLING;

INTEGER PROGRAMMING;

EID: 84904214491     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (49)

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network flows: Theory, algorithms, and applications. Prentice-Hall, 1993.
2. Salem Mohammed Al-Yakoob and Hanif D. Sherali. A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations. European J. Oper. Res., page In press., 2007.
3. Pasquale Avella and Igor Vasil’ev. A computational study of a cutting plane algorithm for university course timetabling. J. Scheduling, 8(6):497–514, 2005.
4. Egon Balas and Li Qun Qi. Linear-time separation algorithms for the three-index assignment polytope. Discrete Appl. Math., 43(1):1–12, 1993.
5. Egon Balas and Matthew J. Saltzman. An algorithm for the three-index assignment problem. Oper. Res., 39(1):150–161, 1991.
6. Victor A. Bardadym. Computer-aided school and university timetabling: The new wave. In Edmund K. Burke and Peter Ross, editors, Practice and Theory of Automated Timetabling, volume LNCS 1153 of Lecture Notes in Computer Science, pages 22–45, Berlin, 1996. Springer.
7. Camille B. Beyrouthy, Edmund K. Burke, Dario Landa Silva, Barry McCollum, Peter McMullan, and Andrew J. Parkes. Towards improving the utilisation of university teaching space. J. Op. Res. Soc., to appear, 2007. Also appeared as NOTTCS-TR-2006-5.
8. Edmund K. Burke and Patrick De Causmaecker, editors. Practice and Theory of Automated Timetabling, volume LNCS 2740 of Lecture Notes in Computer Science, Berlin, 2003. Springer.
9. Edmund K. Burke and Sanja Petrovic. Recent research directions in automated timetabling. European J. Oper. Res., 140(2):266–280, 2002.
10. Edmund K. Burke, Kirk Jackson, Jeffrey H. Kingston, and Rupert F. Weare. Automated university timetabling: The state of the art. Comput. J., 40(9):565–571, 1997.
11. Edmund K. Burke, Dominique de Werra, and Jeffrey H. Kingston. Applications to timetabling. In Jonathan L. Gross and Jay Yellen, editors, Handbook of Graph Theory, pages 445–474. CRC, London, UK, 2004.
12. Edmund K. Burke, Jakub Mareček, Andrew J. Parkes, and Hana Rudová. On a clique-based integer programming formulation of vertex colouring with applications in course timetabling. Technical Report NOTTCS-TR-2007-10, The University of Nottingham, Nottingham, 2007. Also available at http://arxiv.org/abs/0710.3603.
13. Edmund K. Burke, Jakub Mareček, Andrew J. Parkes, and Hana Rudová. Penalis-ing patterns in timetables: Novel integer programming formulations. In Stefan Nickel and Jörg Kalcsics, editors, Operations Research Proceedings 2007, Berlin, 2008a. Springer.
14. Edmund K. Burke, Jakub Mareček, Andrew J. Parkes, and Hana Rudová. Decomposition, reformulation, and diving in timetabling. Technical Report NOTTCS-TR-2008-02, The University of Nottingham, Nottingham, 2008b.
15. Manoel Campêlo, Ricardo C. Corrêa, and Yuri Frota. Cliques, holes and the vertex coloring polytope. Inform. Process. Lett., 89(4):159–164, 2003.
16. Alberto Caprara. Properties of some ILP formulations of a class of partitioning problems. Discrete Appl. Math., 87(1-3):11–23, 1998.
17. Michael W. Carter. A Lagrangian relaxation approach to the classroom assignment problem. INFORMS J. Comput., 27:230–245, 1989.
18. Michael W. Carter and Gilbert Laporte. Recent developments in practical course timetabling. In Edmund K. Burke and Michael W. Carter, editors, Practice and Theory of Automated Timetabling, volume LNCS 1408 of Lecture Notes in Computer Science, pages 3–19, Berlin, 1997. Springer.
19. Fabio De Cesco, Luca Di Gaspero, and Andrea Schaerf. Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, and results. In Practice and Theory of Automated Timetabling, to appear, 2008.
20. Vašek Chvátal. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math., 4:305–337, 1973.
21. Pablo Coll, Javier Marenco, Isabel Méndez-Díaz, and Paula Zabala. Facets of the graph coloring polytope. Ann. Oper. Res., 116:79–90, 2002.
22. Artur Czumaj and Andrzej Lingas. Finding a heaviest triangle is not harder than matrix multiplication. In SODA’07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 986–994, Philadelphia, PA, 2007. SIAM.
23. Sophia Daskalaki, Theodore Birbas, and Efthymios Housos. An integer programming formulation for a case study in university timetabling. European J. Oper. Res., 153:117–135, 2004.
24. Sophia Daskalaki, Theodore Birbas, and Efthymios Housos. Efficient solutions for a university timetabling problem through integer programming. European J. Oper. Res., 160:106–120, 2005.
25. Maria Dimopoulou and Panagiotis Miliotis. An automated university course timetabling system developed in a distributed environment: A case study. European J. Oper. Res., 153:136–147, 2004.
26. Luca Di Gaspero and Andrea Schaerf. Multi neighborhood local search with application to the course timetabling problem. In Burke and Causmaecker [2003], pages 262–275.
27. Luca Di Gaspero and Andrea Schaerf. Neighborhood portfolio approach for local search applied to timetabling problems. J. Math. Model. Algorithms, 5(1):65–89, 2006.
28. Luca Di Gaspero, Barry McCollum,, and Andrea Schaerf. The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (Track 3). Technical Report 2007/08/01, University of Udine DIEGM, Udine, Italy, 2007.
29. Geena Gwan and Li Qun Qi. On facets of the three-index assignment polytope. Australas. J. Combin., 6:67–87, 1992.
30. ILOG. ILOG CPLEX Advanced Programming Techniques. ILOG S. A., Incline Village, NV, 2006.
31. Gerald Lach and Marco E. Lübbecke. Curriculum based course timetabling: Optimal solutions to the udine benchmark instances. In Practice and Theory of Automated Timetabling, to appear, 2008a.
32. Gerald Lach and Marco E. Lübbecke. Optimal university course timetables and the partial transversal polytope. In Catherine C. McGeoch, editor, Experimental algorithms, volume LNCS 5038 of Lecture Notes in Computer Science, pages 235–248, Berlin, 2008b. Springer.
33. N. L. Lawrie. An integer linear programming model of a school timetabling problem. Comput. J., 12:307–316, 1969.
34. Barry McCollum. A perspective on bridging the gap between theory and practice in university timetabling. In Edmund K. Burke and Hana Rudová, editors, Practice and Theory of Automated Timetabling, volume LNCS 3867 of Lecture Notes in Computer Science, pages 3–23, Berlin, 2007. Springer.
35. Isabel Méndez-Díaz and Paula Zabala. A cutting plane algorithm for graph coloring. Discrete Appl. Math., 156(2), 2008.
36. S. A. Mirhassani. A computational approach to enhancing course timetabling with integer programming. Appl. Math. Comput., 175:814–822, 2006.
37. Tomáš Müller. ITC-2007 solver description: A hybrid approach. In Practice and Theory of Automated Timetabling, to appear, 2008.
38. Keith Murray, Tomás´ Müller, and Hana Rudová. Modeling and solution of a complex university course timetabling problem. In Edmund K. Burke and Hana Rudová, editors, Practice and Theory of Automated Timetabling, volume LNCS 3867 of Lecture Notes in Computer Science, pages 193–213, Berlin, 2007. Springer.
39. Sanja Petrovic and Edmund K. Burke. University timetabling. In Joseph Le-ung, editor, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, pages 1001–1023. CRC Press, Boca Raton, FL, 2004. ISBN 1584883979.
40. Andrea Qualizza and Paolo Serafini. A column generation scheme for faculty timetabling. In Edmund K. Burke and Michael A. Trick, editors, Practice and Theory of Automated Timetabling, volume LNCS 3616 of Lecture Notes in Computer Science, pages 161–173, Berlin, 2004. Springer.
41. Hana Rudová and Keith Murray. University course timetabling with soft constraints. In Burke and Causmaecker [2003], pages 310–328.
42. Andrea Schaerf. A survey of automated timetabling. Artificial Intelligence Rev., 13 (2):87–127, 1999.
43. Katja Schimmelpfeng and Stefan Helber. Application of a real-world university-course timetabling model solved by integer programming. OR Spectrum, 29: 783–803, 2007.
44. Etsuji Tomita, Akira Tanaka, and Haruhisa Takahashi. The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci., 363(1):28–42, 2006.
45. Arabinda Tripathy. School timetabling – A case in large binary integer linear programming. Management Sci., 30:1473–1489, 1984.
46. Milan Vlach. Branch and bound method for the three-index assignment problem. Ekonom.-Mat. Obzor, 3:181–191, 1967.
47. Dominic J. A. Welsh, and Martin B. Powel. An upper bound for the chromatic number of a graph and its application to timetabling problems. Computer J., 10 (1):85–86, 1967.
48. Paula Zabala and Isabel Méndez-Díaz. A branch-and-cut algorithm for graph coloring. Discrete Appl. Math., 154(5):826–847, 2006.
49. David Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput., 3(6):103–128, 2007.