{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:36:07Z","timestamp":1794342967739,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540462675","type":"print"},{"value":"9783540462682","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889205_44","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T08:07:42Z","timestamp":1159430862000},"page":"620-634","source":"Crossref","is-referenced-by-count":34,"title":["Revisiting the Sequence Constraint"],"prefix":"10.1007","author":[{"given":"Willem-Jan","family":"van Hoeve","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"}]},{"given":"Ashish","family":"Sabharwal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K.R. Apt","year":"2003","unstructured":"Apt, K.R.: Principles of Constraint Programming. Cambridge Univ. Press, Cambridge (2003)"},{"key":"44_CR2","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-Path Constraint Family. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 59\u201373. Springer, Heidelberg (2001)"},{"key":"44_CR3","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.-X.: Global Constraint Catalog. Technical Report T2005-08, SICS (2005)"},{"issue":"12","key":"44_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling\u00a020(12), 97\u2013123 (1994)","journal-title":"Journal of Mathematical and Computer Modelling"},{"key":"44_CR5","unstructured":"Demassey, S., Pesant, G., Rousseau, L.-M.: A cost-regular based hybrid column generation approach. Constraints (under final review)"},{"key":"44_CR6","unstructured":"Mohr, R., Masini, G.: Good Old Discrete Relaxation. In: European Conference on Artificial Intelligence (ECAI), pp. 651\u2013656 (1988)"},{"key":"44_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":"44_CR8","unstructured":"R\u00e9gin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraint. In: AAAI\/IAAI, pp. 209\u2013215. AAAI Press\/The MIT Press (1996)"},{"key":"44_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/11493853_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J.-C. R\u00e9gin","year":"2005","unstructured":"R\u00e9gin, J.-C.: Combination of Among and Cardinality Constraints. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 288\u2013303. Springer, Heidelberg (2005)"},{"key":"44_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0017428","volume-title":"Principles and Practice of Constraint Programming - CP 1997","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":"44_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1021801522545","volume":"118","author":"M.A. Trick","year":"2003","unstructured":"Trick, M.A.: A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints. Annals of Operations Research\u00a0118, 73\u201384 (2003)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889205_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T23:09:55Z","timestamp":1552259395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11889205_44","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11889205","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}