{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:12:06Z","timestamp":1742926326366,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642213106"},{"type":"electronic","value":"9783642213113"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21311-3_23","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T08:47:22Z","timestamp":1304585242000},"page":"246-251","source":"Crossref","is-referenced-by-count":0,"title":["Identifying Patterns in Sequences of Variables"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Zanarini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Patat 2010 - Nurse Rostering Competition, \n                    http:\/\/www.kuleuven-kortrijk.be\/nrpcompetition\n                   (Online; accessed March 11, 2011)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient String Matching: an Aid to Bibliographic Search. Communication of ACM\u00a018, 333\u2013340 (1975)","journal-title":"Communication of ACM"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-45635-X_12","volume-title":"Logic Programming","author":"N. Beldiceanu","year":"2001","unstructured":"Beldiceanu, N., Carlsson, M.: Revisiting the Cardinality Operator and Introducing the Cardinality\u2009\u2212\u2009Path Constraint Family. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 59\u201373. Springer, Heidelberg (2001)"},{"issue":"4","key":"23_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10601-006-9003-7","volume":"11","author":"S. Demassey","year":"2006","unstructured":"Demassey, S., Pesant, G., Rousseau, L.-M.: A Cost-Regular Based Hybrid Column Generation Approach. Constraints\u00a011(4), 315\u2013333 (2006)","journal-title":"Constraints"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-01929-6_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J. Menana","year":"2009","unstructured":"Menana, J., Demassey, S.: Sequencing and Counting with the multicost-regular Constraint. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 178\u2013192. Springer, Heidelberg (2009)"},{"key":"23_CR6","unstructured":"Menana, J., Demassey, S., Jussien, N.: Mod\u00e9lisation et Optimisation des Pr\u00e9f\u00e9rences en Planification de Personnel. Research report 10-01-INFO, \u00c9cole des Mines de Nantes (2010)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-04244-7_9","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"J.-P. M\u00e9tivier","year":"2009","unstructured":"M\u00e9tivier, J.-P., Boizumault, P., Loudni, S.: Solving nurse rostering problems using soft global constraints. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 73\u201387. Springer, Heidelberg (2009)"},{"key":"23_CR8","unstructured":"University of\u00a0Nottingham. Staff Rostering Benchmark, \n                    http:\/\/www.cs.nott.ac.uk\/~tec\/NRP\/\n                   (Online; accessed March 11, 2011)"},{"key":"23_CR9","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":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/11889205_64","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"C.-G. Quimper","year":"2006","unstructured":"Quimper, C.-G., Walsh, T.: Global grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 751\u2013755. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21311-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:04:32Z","timestamp":1609203872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21311-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213106","9783642213113"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21311-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}