{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:11:18Z","timestamp":1725505878387},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540779025"},{"type":"electronic","value":"9783540779032"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77903-2_63","type":"book-chapter","created":{"date-parts":[[2008,3,19]],"date-time":"2008-03-19T09:48:02Z","timestamp":1205920082000},"page":"409-414","source":"Crossref","is-referenced-by-count":17,"title":["Penalising Patterns in Timetables: Novel Integer Programming Formulations"],"prefix":"10.1007","author":[{"given":"Edmund K.","family":"Burke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Mare\u010dek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew J.","family":"Parkes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hana","family":"Rudov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"63_CR1","unstructured":"T. Achterberg. Constraint Integer Programming. PhD thesis, Berlin, 2007."},{"issue":"6","key":"63_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10951-005-4780-1","volume":"8","author":"P. Avella","year":"2005","unstructured":"P. Avella and I. Vasil\u2019ev. A computational study of a cutting plane algorithm for university course timetabling. J. Scheduling, 8(6):497\u2013514, 2005.","journal-title":"J. Scheduling"},{"key":"63_CR3","first-page":"445","volume-title":"Handbook of Graph Theory","author":"E. K. Burke","year":"2004","unstructured":"E. K. Burke, D. de Werra, and J. H. Kingston. Applications to timetabling. In Handbook of Graph Theory, pages 445\u2013474. CRC, London, UK, 2004."},{"key":"63_CR4","unstructured":"E. K. Burke, J. Mare\u010dek, A. J. Parkes, and H. Rudov\u00e1. On a clique-based integer programming formulation of vertex colouring with applications in course timetabling. Technical report, 2007. at http:\/\/arxiv.org\/abs\/0710.3603."},{"issue":"2","key":"63_CR5","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E. K. Burke","year":"2002","unstructured":"E. K. Burke and S. Petrovic. Recent research directions in automated timetabling. European J. Oper. Res., 140(2):266\u2013280, 2002.","journal-title":"European J. Oper. Res."},{"key":"63_CR6","doi-asserted-by":"crossref","unstructured":"L. D. Gaspero and A. Schaerf. Multi neighborhood local search with application to the course timetabling problem. In Practice and Theory of Automated Timetabling, PATAT 2002, pages 262\u2013275, Berlin, 2003. Springer.","DOI":"10.1007\/978-3-540-45157-0_17"},{"issue":"1","key":"63_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L. D. Gaspero","year":"2006","unstructured":"L. D. Gaspero and A. Schaerf. Neighborhood portfolio approach for local search applied to timetabling problems. J. Math. Model. Algorithms, 5(1):65\u201389, 2006.","journal-title":"J. Math. Model. Algorithms"},{"key":"63_CR8","unstructured":"T. Koch. Rapid Mathematical Programming. PhD thesis, Berlin, 2004."},{"key":"63_CR9","doi-asserted-by":"crossref","unstructured":"I. M\u00e9ndez-D\u00edaz and P. Zabala. A cutting plane algorithm for graph coloring. Discrete App. Math., 2008. In press.","DOI":"10.1016\/j.dam.2006.07.010"},{"key":"63_CR10","doi-asserted-by":"crossref","unstructured":"H. Rudov\u00e1 and K. Murray. University course timetabling with soft constraints. In Practice and Theory of Automated Timetabling, PATAT 2002, pages 310\u2013328, Berlin, 2003. Springer.","DOI":"10.1007\/978-3-540-45157-0_21"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77903-2_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:55:44Z","timestamp":1619520944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77903-2_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540779025","9783540779032"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77903-2_63","relation":{},"subject":[]}}