{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:28:26Z","timestamp":1763641706553},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,9,26]],"date-time":"2013-09-26T00:00:00Z","timestamp":1380153600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10601-013-9150-6","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T07:22:59Z","timestamp":1380093779000},"page":"30-56","source":"Crossref","is-referenced-by-count":4,"title":["An optimal arc consistency algorithm for a particular case of sequence constraint"],"prefix":"10.1007","volume":"19","author":[{"given":"Mohamed","family":"Siala","sequence":"first","affiliation":[]},{"given":"Emmanuel","family":"Hebrard","sequence":"additional","affiliation":[]},{"given":"Marie-Jos\u00e9","family":"Huguet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,26]]},"reference":[{"key":"9150_CR1","unstructured":"Beldiceanu, N., & Carlsson, M. (2001). Revisiting the cardinality operator and introducing the cardinality-path constraint family. In ICLP (pp.\u00a059\u201373)."},{"issue":"12","key":"9150_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., & Contejean, E. (1994). Introducing global constraints in CHIP. Mathematical Computation Modelling, 20(12), 97\u2013123.","journal-title":"Mathematical Computation Modelling"},{"key":"9150_CR3","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T. (2006). The slide meta-constraint. In CPAI workshop, held alongside CP."},{"key":"9150_CR4","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T. (2008). Slide: A useful special case of the cardpath constraint. In ECAI (pp. 475\u2013479)."},{"key":"9150_CR5","doi-asserted-by":"crossref","unstructured":"Brand, S., Narodytska, N., Quimper, C.-G., Stuckey, P.J., Walsh, T. (2007). Encodings of the sequence constraint. In CP (pp.\u00a0210\u2013224).","DOI":"10.1007\/978-3-540-74970-7_17"},{"issue":"4","key":"9150_CR6","doi-asserted-by":"crossref","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. (2006). A cost-regular based hybrid column generation approach. Constraints, 11(4), 315\u2013333.","journal-title":"Constraints"},{"key":"9150_CR7","unstructured":"Dincbas, M., Simonis, H., Van\u00a0Hentenryck, P. (1988). Solving the car-sequencing problem in constraint logic programming. In ECAI (pp.\u00a0290\u2013295)."},{"key":"9150_CR8","doi-asserted-by":"crossref","unstructured":"Gent, I.P., & Walsh, T. (1999). CSPLib: a benchmark library for constraints. In CP (pp. 480\u2013481).","DOI":"10.1007\/978-3-540-48085-3_36"},{"issue":"1","key":"9150_CR9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0360-8352(94)90038-8","volume":"26","author":"K-S Hindi","year":"1994","unstructured":"Hindi, K.-S., & Ploszajski, G. (1994). Formulation and solution of a selection and sequencing problem in car manufacture. Computers & Industrial Engineering, 26(1), 203\u2013211.","journal-title":"Computers & Industrial Engineering"},{"key":"9150_CR10","doi-asserted-by":"crossref","unstructured":"Maher, M.J., Narodytska, N., Quimper, C.-G., Walsh, T. (2008). Flow-based propagators for the Sequence and related global constraints. In CP (pp.\u00a0159\u2013174).","DOI":"10.1007\/978-3-540-85958-1_11"},{"key":"9150_CR11","doi-asserted-by":"crossref","unstructured":"Menana, J., & Demassey, S. (2009). Sequencing and counting with the multicost-regular constraint. In CPAIOR (pp.\u00a0178\u2013192).","DOI":"10.1007\/978-3-642-01929-6_14"},{"key":"9150_CR12","doi-asserted-by":"crossref","unstructured":"Perron, L., & Shaw, P. (2004). Combining forces to solve the car sequencing problem. In CPAIOR (pp.\u00a0225\u2013239).","DOI":"10.1007\/978-3-540-24664-0_16"},{"key":"9150_CR13","doi-asserted-by":"crossref","unstructured":"Perron, L., Shaw, P., Furnon, V. (2004). Propagation guided large neighborhood search. In CP (pp.\u00a0468\u2013481).","DOI":"10.1007\/978-3-540-30201-8_35"},{"key":"9150_CR14","doi-asserted-by":"crossref","unstructured":"Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In CP (pp.\u00a0482\u2013495).","DOI":"10.1007\/978-3-540-30201-8_36"},{"key":"9150_CR15","unstructured":"Pesant, G. (2008) Constraint-based rostering. In PATAT."},{"key":"9150_CR16","unstructured":"R\u00e9gin, J.-C. (1996). Generalized arc consistency for global cardinality constraint. In AAAI (pp.\u00a0209\u2013215)"},{"key":"9150_CR17","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C., & Puget, J.-F. (1997). A filtering algorithm for global sequencing constraints. In CP (pp.\u00a032\u201346).","DOI":"10.1007\/BFb0017428"},{"key":"9150_CR18","unstructured":"Siala, M., Hebrard, E., Huguet, M.-J. (2012). A study of branching heuristics for the car-sequencing problem. In SSNOW workshop, held alongside CPAIOR."},{"key":"9150_CR19","unstructured":"Smith, B.M. (1997). Succeed-first or fail-first: a case study in variable and value ordering. In PACT (pp. 321\u2013330)."},{"key":"9150_CR20","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","volume":"191","author":"C Solnon","year":"2008","unstructured":"Solnon, C., Cung, V., Nguyen, A., Artigues, C. (2008). The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF\u20192005 challenge problem. EJOR, 191, 912\u2013927.","journal-title":"EJOR"},{"issue":"2","key":"9150_CR21","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10601-008-9067-7","volume":"14","author":"WJ Hoeve van","year":"2009","unstructured":"van\u00a0Hoeve, W.J., Pesant, G., Rousseau, L.-M., Sabharwal, A. (2009). New filtering algorithms for combinations of among constraints. Constraints, 14(2), 273\u2013292.","journal-title":"Constraints"},{"key":"9150_CR22","doi-asserted-by":"crossref","unstructured":"van\u00a0Hoeve, W.J., Pesant, G., Rousseau, L.-M., Sabharwal, A. (2006). Revisiting the sequence constraint. In CP (pp.\u00a0620\u2013634).","DOI":"10.1007\/11889205_44"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-013-9150-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-013-9150-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-013-9150-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T10:40:21Z","timestamp":1564051221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-013-9150-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,26]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9150"],"URL":"https:\/\/doi.org\/10.1007\/s10601-013-9150-6","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,26]]}}}