{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:55:49Z","timestamp":1725573349590},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540307051"},{"type":"electronic","value":"9783540324218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11593577_10","type":"book-chapter","created":{"date-parts":[[2005,11,5]],"date-time":"2005-11-05T07:32:45Z","timestamp":1131175965000},"page":"161-173","source":"Crossref","is-referenced-by-count":7,"title":["A Column Generation Scheme for Faculty Timetabling"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Qualizza","sequence":"first","affiliation":[]},{"given":"Paolo","family":"Serafini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0305-0548(89)90053-1","volume":"16","author":"J. Aubin","year":"1989","unstructured":"Aubin, J., Ferland, J.A.: A Large Scale Timetabling Problem. Comput. Oper. Res. 16, 67\u201377 (1989)","journal-title":"Comput. Oper. Res."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.: Branch-and-Price: Column Generation for Solving Huge Integer Problems. Oper. Res. 46, 316\u2013329 (1998)","journal-title":"Oper. Res."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Daskalaki, S., Birbas, T., Housos, E.: An Integer Programming Formulation for a Case Study in University Timetabling. Eur. J. Oper. Res. 153, 117\u2013135 (2004)","DOI":"10.1016\/S0377-2217(03)00103-6"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1287\/inte.24.2.105","volume":"24","author":"J.A. Ferland","year":"1994","unstructured":"Ferland, J.A., Fleurent, C.: SAPHIR: A Decision Support System for Course Scheduling. Interfaces 24, 105\u2013115 (1994)","journal-title":"Interfaces"},{"key":"10_CR5","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/S0377-2217(96)00082-3","volume":"101","author":"T.H. Hultberg","year":"1997","unstructured":"Hultberg, T.H., Cardoso, D.M.: The Teacher Assignment Problem: A Special Case of the Fixed Charge Transportation Problem. Eur. J. Oper. Res. 101, 463\u2013473 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Maculan, N., de Mendon\u00e7a Passini, M., de Moura Brito, J.A., Loiseau, I.: Column-Generation in Integer Linear Programming. RAIRO Oper. Res. 37, 67\u201383 (2003)","DOI":"10.1051\/ro:2003014"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1057\/palgrave.jors.2601495","volume":"54","author":"K. Papoutsis","year":"2003","unstructured":"Papoutsis, K., Valouxis, C., Housos, E.: A Column Generation Approach for the Timetabling Problem of Greek High Schools. J. Oper. Res. Soc. 54, 230\u2013238 (2003)","journal-title":"J. Oper. Res. Soc."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Schaerf, A.: A Survey of Automated Timetabling. Artif. Intell. Rev. 13, 87\u2013127 (1999)","DOI":"10.1023\/A:1006576209967"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"de Werra, D.: An Introduction to Timetabling. Eur. J. Oper. Res. 19, 151\u2013162 (1985)","DOI":"10.1016\/0377-2217(85)90167-5"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/S0377-2217(96)00111-7","volume":"96","author":"D. Werra","year":"1997","unstructured":"de Werra, D.: The Combinatorics of Timetabling. Eur. J. Oper. Res. 96, 504\u2013513 (1997)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11593577_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:53Z","timestamp":1619506313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593577_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540307051","9783540324218"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11593577_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}