{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:35:31Z","timestamp":1794378931038,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540261520","type":"print"},{"value":"9783540322641","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11493853_12","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T03:35:25Z","timestamp":1279078525000},"page":"140-154","source":"Crossref","is-referenced-by-count":26,"title":["Constraint Programming Based Column Generation for Employee Timetabling"],"prefix":"10.1007","author":[{"given":"Sophie","family":"Demassey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gilles","family":"Pesant","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Louis-Martin","family":"Rousseau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/3-540-46135-3_40","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"T. Benoist","year":"2002","unstructured":"Benoist, T., Gaudin, E., Rottembourg, B.: Constraint programming contribution to Benders decomposition: a case study. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 603\u2013617. Springer, Heidelberg (2002)"},{"key":"12_CR2","unstructured":"Chabrier, A.: Maestro: A column and cut generation modeling and search framework. Technical report, ILOG SA (2002)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1013613701606","volume":"8","author":"T. Fahle","year":"2002","unstructured":"Fahle, T., Junker, U., Karish, S.E., Kohl, N., Vaaben, N., Sellmann, M.: Constraint programming based column generation for crew assignment. Journal of Heuristics\u00a08, 59\u201381 (2002)","journal-title":"Journal of Heuristics"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1021193019522","volume":"115","author":"T. Fahle","year":"2002","unstructured":"Fahle, T., Sellmann, M.: Cost based filtering for the constrained knapsack problem. Annals of Operations Research\u00a0115, 73\u201393 (2002)","journal-title":"Annals of Operations Research"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-3-540-48085-3_19","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"U. Junker","year":"1999","unstructured":"Junker, U., Karish, S.E., Kohl, N., Vaaben, N., Fahle, T., Sellmann, M.: A framework for constraint programming based column generation. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 261\u2013275. Springer, Heidelberg (1999)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-45578-7_13","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"G. Pesant","year":"2001","unstructured":"Pesant, G.: A filtering algorithm for the stretch constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 183\u2013195. Springer, Heidelberg (2001)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-30201-8_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"G. Pesant","year":"2004","unstructured":"Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 482\u2013495. Springer, Heidelberg (2004)"},{"key":"12_CR8","unstructured":"R\u00e9gin, J.-C.: Generalized arc consistency for global cardinality constraints. In: Proc. of AAAI 1996, pp. 209\u2013215. AAAI Press\/The MIT Press (1996)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0017428","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"J.-C. R\u00e9gin","year":"1997","unstructured":"R\u00e9gin, J.-C., Puget, J.-F.: A filtering algorithm for global sequencing constraints. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 32\u201346. Springer, Heidelberg (1997)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/B:ANOR.0000032576.73681.29","volume":"130","author":"L.-M. Rousseau","year":"2004","unstructured":"Rousseau, L.-M., Gendreau, M., Pesant, G., Focacci, F.: Solving VRPTWs with constraint programming based column generation. Annals of Operations Research\u00a0130, 199\u2013216 (2004)","journal-title":"Annals of Operations Research"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-24664-0_30","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"L.-M. Rousseau","year":"2004","unstructured":"Rousseau, L.-M.: Stabilization issues for constraint programming based column generation. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 402\u2013408. Springer, Heidelberg (2004)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1021105422248","volume":"115","author":"M. Sellmann","year":"2002","unstructured":"Sellmann, M., Zervoudakis, K., Stamatopoulos, P., Fahle, T.: Crew assignment via constraint programming: integrating column generation and heuristic tree search. Annals of Operations Research\u00a0115, 207\u2013225 (2002)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11493853_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:37:56Z","timestamp":1619491076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11493853_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261520","9783540322641"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11493853_12","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b136920","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}