{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T10:36:08Z","timestamp":1776681368742,"version":"3.51.2"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T00:00:00Z","timestamp":1646956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T00:00:00Z","timestamp":1646956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100012774","name":"Innovationsfonden","doi-asserted-by":"publisher","award":["8090-00052"],"award-info":[{"award-number":["8090-00052"]}],"id":[{"id":"10.13039\/100012774","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10951-022-00724-y","type":"journal-article","created":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T19:02:46Z","timestamp":1647025366000},"page":"405-428","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A graph-based MIP formulation of the International Timetabling Competition 2019"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8361-0311","authenticated-orcid":false,"given":"Dennis S.","family":"Holm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3416-7349","authenticated-orcid":false,"given":"Rasmus \u00d8.","family":"Mikkelsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6906-004X","authenticated-orcid":false,"given":"Matias","family":"S\u00f8rensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6905-5454","authenticated-orcid":false,"given":"Thomas J. R.","family":"Stidsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,11]]},"reference":[{"issue":"2","key":"724_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10951-018-0582-0","volume":"22","author":"N Bagger","year":"2019","unstructured":"Bagger, N., Desaulniers, G., & Desrosiers, J. (2019). Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem. Journal of Scheduling, 22(2), 155\u2013172. https:\/\/doi.org\/10.1007\/s10951-018-0582-0.","journal-title":"Journal of Scheduling"},{"issue":"1\u20132","key":"724_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10479-018-3096-4","volume":"280","author":"N Bagger","year":"2019","unstructured":"Bagger, N., Kristiansen, S., S\u00f8rensen, M., & Stidsen, T. (2019). Flow formulations for curriculum-based course timetabling. Annals of Operations Research, 280(1\u20132), 121\u2013150. https:\/\/doi.org\/10.1007\/s10479-018-3096-4.","journal-title":"Annals of Operations Research"},{"key":"724_CR3","unstructured":"B\u00f6varsdottir, E., Bagger, N., H\u00f8ffner, L., and Stidsen, T. (2019). A comprehensive integer programming formulation of the nurse rostering problem in Denmark. Technical report. Technical University of Denmark."},{"key":"724_CR4","doi-asserted-by":"publisher","unstructured":"Bron, C., & Kerbosch, J. (1973). Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM, 16(9), 575\u2013577. https:\/\/doi.org\/10.1145\/362342.362367.","DOI":"10.1145\/362342.362367"},{"key":"724_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-77903-2_63","volume-title":"Operations research proceedings 2007","author":"EK Burke","year":"2008","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2008). Penalising patterns in timetables: Novel integer programming formulations. In J. Kalcsics & S. Nickel (Eds.), Operations research proceedings 2007 (pp. 409\u2013414). Berlin: Springer."},{"issue":"1","key":"724_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10479-010-0716-z","volume":"179","author":"EK Burke","year":"2010","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2010). A supernodal formulation of vertex colouring with applications in course timetabling. Annals of Operations Research, 179(1), 105\u2013130.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"724_CR7","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.cor.2009.02.023","volume":"37","author":"EK Burke","year":"2010","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2010). Decomposition, reformulation, and diving in university course timetabling. Computers and Operations Research, 37(3), 582\u2013597. https:\/\/doi.org\/10.1016\/j.cor.2009.02.023.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"724_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10479-010-0828-5","volume":"194","author":"EK Burke","year":"2012","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2012). A branch-and-cut procedure for the Udine Course Timetabling problem. Annals of Operations Research, 194(1), 71\u201387. https:\/\/doi.org\/10.1007\/s10479-010-0828-5.","journal-title":"Annals of Operations Research"},{"key":"724_CR9","doi-asserted-by":"crossref","unstructured":"Cooper, T. B., & Kingston, J. H. (1996). The complexity of timetable construction problems. In E. Burke & P. Ross (Eds.), Practice and theory of automated timetabling (pp. 281\u2013295). Berlin: Springer.","DOI":"10.1007\/3-540-61794-9_66"},{"key":"724_CR10","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., & Niedermeier, R. (2006). Data reduction, exact, and heuristic algorithms for clique cover. In In proceedings of the 8th ALENEX (pp. 86\u201394). SIAM.","DOI":"10.1137\/1.9781611972863.9"},{"key":"724_CR11","unstructured":"Holm, D., Mikkelsen, R., S\u00f8rensen, M., & Stidsen, T. (2020). A MIP formulation of the international timetabling competition 2019 problem. Technical report. Technical University of Denmark."},{"issue":"2","key":"724_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/359340.359346","volume":"21","author":"LT Kou","year":"1978","unstructured":"Kou, L. T., Stockmeyer, L. J., & Wong, C. K. (1978). Covering edges by cliques with regard to keyword conflicts and intersection graphs. Communications of the ACM, 21(2), 135\u2013139.","journal-title":"Communications of the ACM"},{"issue":"1","key":"724_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B McCollum","year":"2010","unstructured":"McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A. J., et al. (2010). Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS Journal on Computing, 22(1), 120\u2013130. https:\/\/doi.org\/10.1287\/ijoc.1090.0320.","journal-title":"INFORMS Journal on Computing"},{"key":"724_CR14","unstructured":"M\u00fcller, T., Rudov\u00e1, H., & M\u00fcllerov\u00e1, Z. (2018). University course timetabling and International timetabling competition 2019. In Burke, E.\u00a0K., Di\u00a0Gaspero, L., McCollum, B., Musliu, N., & \u00d6zcan, E., (Eds.), Proceedings of the 12th international conference of the practice and theory of automated timetabling (PATAT 2018), Vienna, Austria (pp. 5\u201331)."},{"key":"724_CR15","doi-asserted-by":"publisher","unstructured":"Nemhauser, G. & Wolsey, L. (2014). Strong valid inequalities and facets for structured integer programs, In Integer and combinatorial optimization, chapter II.2 (pp. 259\u2013295). Wiley. https:\/\/doi.org\/10.1002\/9781118627372.ch9.","DOI":"10.1002\/9781118627372.ch9"},{"key":"724_CR16","unstructured":"Paechter, B., Gambardella, L., & Rossi-Doria, O. (2002). International timetabling competition 2002. http:\/\/sferics.idsia.ch\/Files\/ttcomp2002\/"},{"issue":"1","key":"724_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10479-013-1340-5","volume":"239","author":"G Post","year":"2016","unstructured":"Post, G., Di Gaspero, L., Kingston, J. H., McCollum, B., & Schaerf, A. (2016). The third international timetabling competition. Annals of Operations Research, 239(1), 69\u201375. https:\/\/doi.org\/10.1007\/s10479-013-1340-5.","journal-title":"Annals of Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00724-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00724-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00724-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:01:41Z","timestamp":1659078101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00724-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,11]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["724"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00724-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,11]]},"assertion":[{"value":"24 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}