{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T07:52:51Z","timestamp":1774770771407,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T00:00:00Z","timestamp":1541980800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100012774","name":"Innovation Fund Denmark","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100012774","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10479-018-3096-4","type":"journal-article","created":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T10:19:35Z","timestamp":1542017975000},"page":"121-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Flow formulations for curriculum-based course timetabling"],"prefix":"10.1007","volume":"280","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4665-6761","authenticated-orcid":false,"given":"Niels-Christian F.","family":"Bagger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Kristiansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias","family":"S\u00f8rensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas R.","family":"Stidsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,12]]},"reference":[{"key":"3096_CR1","volume-title":"Network flows: Theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Upper Saddle River, NJ: Prentice-Hall Inc."},{"key":"3096_CR2","unstructured":"Bagger, N., Kristiansen, S., S\u00f8rensen, M., & Stidsen, T. (2015). Flow formulation-based model for the curriculum-based course timetabling problem. In Proceedings of the 7th multidisciplinary international conference on scheduling: Theory and applications (MISTA 2015) (pp. 825\u2013848)."},{"key":"3096_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11750-015-0366-z","volume":"23","author":"A Bettinelli","year":"2015","unstructured":"Bettinelli, A., Cacchiani, V., Roberti, R., & Toth, P. (2015). An overview of curriculum-based course timetabling. TOP, 23, 313\u2013349.","journal-title":"TOP"},{"issue":"1","key":"3096_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10479-010-0707-0","volume":"194","author":"A Bonutti","year":"2012","unstructured":"Bonutti, A., De Cesco, F., Di Gaspero, L., & Schaerf, A. (2012). Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, visualization, and results. Annals of Operations Research, 194(1), 59\u201370.","journal-title":"Annals of Operations Research"},{"issue":"9","key":"3096_CR5","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., & Kerbosch, J. (1973). Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM, 16(9), 575\u2013577. \n                    https:\/\/doi.org\/10.1145\/362342.362367\n                    \n                  .","journal-title":"Communications of the ACM"},{"key":"3096_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-77903-2_63","volume-title":"Operations research proceedings","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 (pp. 409\u2013414). Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/978-3-540-77903-2_63\n                    \n                  ."},{"issue":"3","key":"3096_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 & Operations Research, 37(3), 582\u2013597.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"3096_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.","journal-title":"Annals of Operations Research"},{"issue":"10","key":"3096_CR9","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1016\/j.cor.2013.02.010","volume":"40","author":"V Cacchiani","year":"2013","unstructured":"Cacchiani, V., Caprara, A., Roberti, R., & Toth, P. (2013). A new lower bound for curriculum-based course timetabling. Computers & Operations Research, 40(10), 2466\u20132477.","journal-title":"Computers & Operations Research"},{"key":"3096_CR10","unstructured":"Di\u00a0Gaspero, L., McCollum, B., & Schaerf, A. (2007). The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (track 3). Technical report, School of Electronics, Electrical Engineering and Computer Science, Queenes University SARC Building, Belfast, UK."},{"key":"3096_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-540-45157-0_17","volume-title":"Practice and theory of automated timetabling IV","author":"L Gaspero Di","year":"2003","unstructured":"Di Gaspero, L., & Schaerf, A. (2003). Multi-neighbourhood local search with application to course timetabling. In E. Burke & P. De Causmaecker (Eds.), Practice and theory of automated timetabling IV (Vol. 2740, pp. 262\u2013275)., Lecture notes in computer science Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/978-3-540-45157-0_17\n                    \n                  ."},{"key":"3096_CR12","unstructured":"Gurobi Optimization, Inc. (2016). Gurobi optimizer reference manual. \n                    http:\/\/www.gurobi.com\n                    \n                  . Accessed 26 Dec 2016."},{"issue":"3","key":"3096_CR13","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.ejor.2011.02.019","volume":"212","author":"JK Hao","year":"2011","unstructured":"Hao, J. K., & Benlic, U. (2011). Lower bounds for the ITC-2007 curriculum-based course timetabling problem. European Journal of Operational Research, 212(3), 464\u2013472.","journal-title":"European Journal of Operational Research"},{"key":"3096_CR14","volume-title":"Algorithm design","author":"J Kleinberg","year":"2005","unstructured":"Kleinberg, J., & Tardos, E. (2005). Algorithm design. Boston, MA: Addison-Wesley Longman Publishing Co., Inc."},{"key":"3096_CR15","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-68552-4_18","volume-title":"Experimental algorithms","author":"G Lach","year":"2008","unstructured":"Lach, G., & L\u00fcbbecke, M. (2008). Optimal university course timetables and the partial transversal polytope. In C. McGeoch (Ed.), Experimental algorithms (Vol. 5038, pp. 235\u2013248)., Lecture notes in computer science Berlin: Springer."},{"key":"3096_CR16","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10479-010-0700-7","volume":"194","author":"G Lach","year":"2012","unstructured":"Lach, G., & L\u00fcbbecke, M. (2012). Curriculum based course timetabling: New solutions to udine benchmark instances. Annals of Operations Research, 194, 255\u2013272.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3096_CR17","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.","journal-title":"INFORMS Journal on Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3096-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-3096-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3096-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T19:09:25Z","timestamp":1573499365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-3096-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,12]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["3096"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-3096-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,12]]},"assertion":[{"value":"12 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}