{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:12Z","timestamp":1725664332744},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617945"},{"type":"electronic","value":"9783540706823"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61794-9_71","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:25:53Z","timestamp":1330277153000},"page":"364-373","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["How to decompose constrained course scheduling problems into easier assignment type subproblems"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Robert","sequence":"first","affiliation":[]},{"given":"Alain","family":"Hertz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/0220012","volume":"20\/2","author":"E. Balas","year":"1991","unstructured":"Balas, E. and Xue, J., \u201cMinimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs\u201d, SIAM J. Comput. 20\/2 (1991) 209\u2013221.","journal-title":"SIAM J. Comput."},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.14.1.52","volume":"14","author":"R.C. Carlson","year":"1966","unstructured":"Carlson, R.C. and Nemhauser, G.L., \u201cScheduling to minimize interaction cost\u201d, Operations Research 14 (1966) 52\u201358.","journal-title":"Operations Research"},{"key":"23_CR3","first-page":"248","volume":"19\/2","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J. and Karp, R.M., \u201cTheoretical improvements in algorithmic efficiency for network flow problems\u201d, Journal of the A.C.M. 19\/2 (1972) 248\u2013264.","journal-title":"Journal of the A.C.M."},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-218X(92)90247-8","volume":"35","author":"J.A. Ferland","year":"1992","unstructured":"Ferland, J.A. and Lavoie, A., \u201cExchanges procedures for timetabling problems\u201d, Discrete Applied Mathematics 35 (1992) 237\u2013253.","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0305-0548(90)90048-C","volume":"17","author":"C. Friden","year":"1990","unstructured":"Friden, C., Hertz, A. and de Werra D., \u201cTABARIS: an exact algorithm based on tabu search for finding a maximum independent set in a graph\u201d, Computers and Operations Research 17 (1990) 437\u2013445.","journal-title":"Computers and Operations Research"},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0377-2217(81)90279-4","volume":"7","author":"O.B. Gans de","year":"1981","unstructured":"de Gans, O.B., \u201cA computer timetabling system for secondary schools in the Netherlands\u201d, European Journal of Operational Research 7 (1981) 175\u2013182.","journal-title":"European Journal of Operational Research"},{"key":"23_CR7","volume-title":"Computers and Intractibility: a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and Johnson, D.S., \u201cComputers and Intractibility: a Guide to the Theory of NP-Completeness\u201d, Freeman, New York (1979)."},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F., \u201cTabu Search, Part I\u201d, ORSA Journal on Computing 1 (1989) 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F., \u201cTabu Search, Part II\u201d, ORSA Journal on Computing 2 (1990) 4\u201332.","journal-title":"ORSA Journal on Computing"},{"key":"23_CR10","volume-title":"ORWP 94\/10","author":"A. Hertz","year":"1994","unstructured":"Hertz, A. and Robert V., \u201cConstructing a course schedule by solving a series of assignment type problems\u201d, ORWP 94\/10, Dept of Maths, EPFL, Switzerland (1994)."},{"key":"23_CR11","unstructured":"Mannino, C. and Sassano A., \u201cAn exact algorithm for the stable set problem\u201d, IASI-CNR Report No. 334, Rome, Italy (1992)."},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0377-2217(82)90012-1","volume":"9","author":"J.M. Mulvey","year":"1982","unstructured":"Mulvey, J.M., \u201cA classroom\/time assignment model\u201d, European Journal of Operational Research 9 (1982) 64\u201370.","journal-title":"European Journal of Operational Research"},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","volume":"8","author":"C.T. Ross","year":"1975","unstructured":"Ross, C.T. and Soland, R.M., \u201cA Branch and Bound Algorithm for the Generalized Assignment Problem\u201d, Mathematical Programming 8 (1975) 91\u2013103.","journal-title":"Mathematical Programming"},{"key":"23_CR14","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1057\/jors.1980.116","volume":"31","author":"A. Tripathy","year":"1980","unstructured":"Tripathy, A., \u201cA Lagrangian relaxation approach to course scheduling\u201d, Journal of the Operational Research Society 31 (1980) 599\u2013603.","journal-title":"Journal of the Operational Research Society"},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. Werra de","year":"1985","unstructured":"de Werra, D., \u201cAn introduction to timetabling\u201d, European Journal of Operational Research 19 (1985) 151\u2013162.","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61794-9_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:31:36Z","timestamp":1558254696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61794-9_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617945","9783540706823"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61794-9_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}