{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:54:14Z","timestamp":1649188454229},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,7,22]],"date-time":"2016-07-22T00:00:00Z","timestamp":1469145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund (FWF)","doi-asserted-by":"crossref","award":["P24814-N23"],"award-info":[{"award-number":["P24814-N23"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Vienna PhD School of Informatics"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10479-016-2220-6","type":"journal-article","created":{"date-parts":[[2016,7,22]],"date-time":"2016-07-22T05:09:38Z","timestamp":1469164178000},"page":"215-238","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Modeling high school timetabling with bitvectors"],"prefix":"10.1007","volume":"252","author":[{"given":"Emir","family":"Demirovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,22]]},"reference":[{"key":"2220_CR1","unstructured":"Bj\u00f8rner, N., & Phan, A. D. (2014). \n                        $$\\nu $$\n                        \n                            \n                                            \n                                \u03bd\n                            \n                        \n                    Z-Maximal satisfaction with Z3. In Proceedings of International Symposium on Symbolic Computation in Software Science (SCSS)."},{"key":"2220_CR2","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.endm.2012.10.023","volume":"39","author":"SS Brito","year":"2012","unstructured":"Brito, S. S., Fonseca, G. H. G., Toffolo, T. A. M., Santos, H. G., & Souza, M. J. F. (2012). A SA-ILS approach for the high school timetabling problem. Electronic Notes in Discrete Mathematics, 39, 169\u2013176.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"2220_CR3","doi-asserted-by":"publisher","unstructured":"De\u00a0Moura, L., & Bj\u00f8rner, N. (2008). Z3: An efficient SMT solver. In: Tools and Algorithms for the Construction and Analysis of Systems (pp. 337\u2013340). Springer.","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"2220_CR4","unstructured":"Demirovi\u0107, E., & Musliu, N. (2014). Modeling high school timetabling as partialweighted maxsat. LaSh 2014: The 4th Workshop on Logic and Search (a SAT\/ICLP workshop at FLoC 2014)."},{"key":"2220_CR5","unstructured":"Demirovi\u0107, E., & Musliu, N. (2014). Solving high school timetabling with satisfiability modulo theories. In E. Ozcan, E. K. Burke & B. McCollum (Eds.), Proceedings of the 10th International Conference of the Practice and Theory of Automated Timetabling (pp. 142\u2013166)."},{"key":"2220_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cor.2014.06.023","volume":"52","author":"\u00c1P Dorneles","year":"2014","unstructured":"Dorneles, \u00c1. P., de Araujo, O. C. B., & Buriol, L. S. (2014). A fix-and-optimize heuristic for the high school timetabling problem. Computers & Operations Research, 52, 29\u201338. doi:\n                        10.1016\/j.cor.2014.06.023\n                        \n                    .","journal-title":"Computers & Operations Research"},{"key":"2220_CR7","doi-asserted-by":"publisher","unstructured":"Even, S., Itai, A., & Shamir, A. (1975). On the complexity of time table and multi-commodity flow problems. In Foundations of Computer Science, 1975. 16th Annual Symposium on (pp. 184\u2013193). IEEE.","DOI":"10.1109\/SFCS.1975.21"},{"key":"2220_CR8","unstructured":"Fonseca, G. H., Santos, H. G., & Carrano, E. G. (2015). Late acceptance hill-climbing for high school timetabling. Journal of Scheduling, 1\u201313."},{"key":"2220_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.cor.2013.11.012","volume":"52","author":"GHG Fonseca","year":"2014","unstructured":"Fonseca, G. H. G., & Santos, H. G. (2014). Variable neighborhood search based algorithms for high school timetabling. Computers & Operations Research, 52, 203\u2013208. doi:\n                        10.1016\/j.cor.2013.11.012\n                        \n                    .","journal-title":"Computers & Operations Research"},{"key":"2220_CR10","unstructured":"Kheiri, A., Ozcan, E., & Parkes, A. J. (2012). HySST: hyper-heuristic search strategies and timetabling. In Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012)."},{"key":"2220_CR11","unstructured":"Kingston, J. (2014). KHE14: An algorithm for high school timetabling. In E. Ozcan, E. K. Burke & B. McCollum (Eds.), Proceedings of the 10th International Conference of the Practice and Theory of Automated Timetabling (pp. 498\u2013501)."},{"issue":"4","key":"2220_CR12","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10951-014-0405-x","volume":"18","author":"S Kristiansen","year":"2015","unstructured":"Kristiansen, S., S\u00f8rensen, M., & Stidsen, T. R. (2015). Integer programming for the generalized high school timetabling problem. Journal of Scheduling, 18(4), 377\u2013392. doi:\n                        10.1007\/s10951-014-0405-x\n                        \n                    .","journal-title":"Journal of Scheduling"},{"issue":"1","key":"2220_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10479-010-0699-9","volume":"194","author":"G Post","year":"2012","unstructured":"Post, G., Ahmadi, S., Daskalaki, S., Kingston, J., Kyngas, J., Nurmi, C., et al. (2012). An XML format for benchmarks in high school timetabling. Annals of Operations Research, 194(1), 385\u2013397. doi:\n                        10.1007\/s10479-010-0699-9\n                        \n                    .","journal-title":"Annals of Operations Research"},{"key":"2220_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-013-1340-5","author":"G Post","year":"2013","unstructured":"Post, G., Di Gaspero, L., Kingston, J., McCollum, B., & Schaerf, A. (2013). The third international timetabling competition. Annals of Operations Research,. doi:\n                        10.1007\/s10479-013-1340-5\n                        \n                    .","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2220_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10479-011-1012-2","volume":"218","author":"G Post","year":"2014","unstructured":"Post, G., Kingston, J. H., Ahmadi, S., Daskalaki, S., Gogos, C., Kyng\u00e4s, J., et al. (2014). XHSTT: An XML archive for high school timetabling problems in different countries. Annals of Operations Research, 218(1), 295\u2013301. doi:\n                        10.1007\/s10479-011-1012-2\n                        \n                    .","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2220_CR16","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10479-010-0709-y","volume":"194","author":"HG Santos","year":"2012","unstructured":"Santos, H. G., Uchoa, E., Ochi, L. S., & Maculan, N. (2012). Strong bounds with cut and column generation for class-teacher timetabling. Annals of Operations Research, 194(1), 399\u2013412.","journal-title":"Annals of Operations Research"},{"key":"2220_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.cor.2013.08.025","volume":"43","author":"M S\u00f8rensen","year":"2014","unstructured":"S\u00f8rensen, M., & Dahms, F. H. (2014). A two-stage decomposition of high school timetabling applied to cases in Denmark. Computers & Operations Research, 43, 36\u201349.","journal-title":"Computers & Operations Research"},{"key":"2220_CR18","unstructured":"S\u00f8rensen, M., Kristiansen, S., & Stidsen, T. R. (2012). International timetabling competition 2011: An adaptive large neighborhood search algorithm. In: Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012) (p. 489)."},{"key":"2220_CR19","unstructured":"S\u00f8rensen, M., & Stidsen, T. R. (2012). High school timetabling: Modeling and solving a large number of cases in Denmark. In 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012) (pp. 359\u2013364)."},{"key":"2220_CR20","unstructured":"S\u00f8rensen, M., & Stidsen, T. R. (2013). Comparing solution approaches for a complete model of high school timetabling. Technical report, DTU Management Engineering."},{"key":"2220_CR21","unstructured":"S\u00f8rensen, M., & Stidsen, T. R. (2014). Hybridizing integer programming and metaheuristics for solving high school timetabling. In E. Ozcan, E. K. Burke, & B. McCollum (Eds.), Proceedings of the 10th International Conference of the Practice and Theory of Automated Timetabling (pp. 557\u2013560)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2220-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2220-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2220-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2220-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T01:51:52Z","timestamp":1589680312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2220-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,22]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["2220"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2220-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,22]]}}}