{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:28:42Z","timestamp":1742981322829,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859574"},{"type":"electronic","value":"9783540859581"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85958-1_11","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:26:13Z","timestamp":1221881173000},"page":"159-174","source":"Crossref","is-referenced-by-count":17,"title":["Flow-Based Propagators for the SEQUENCE and Related Global Constraints"],"prefix":"10.1007","author":[{"given":"Michael","family":"Maher","sequence":"first","affiliation":[]},{"given":"Nina","family":"Narodytska","sequence":"additional","affiliation":[]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"R\u00e9gin, J.C.: A filtering algorithm for constraints of difference in csps. In: Proc. of the 12th National Conf. on AI (AAAI 1994), vol.\u00a01, pp. 362\u2013367 (1994)"},{"key":"11_CR2","unstructured":"R\u00e9gin, J.C.: Generalized arc consistency for global cardinality constraint. In: Proc. of the 12th National Conf. on AI (AAAI 1996), pp. 209\u2013215 (1996)"},{"key":"11_CR3","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"12","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Mathematical and Computer Modelling\u00a012, 97\u2013123 (1994)","journal-title":"Mathematical and Computer Modelling"},{"key":"11_CR5","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: The slide meta-constraint. Technical report (2007)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.C., Puget, J.F.: A filtering algorithm for global sequencing constraints. In: Proc. of the 3th Int. Conf. on Principles and Practice of Constraint Programming, pp. 32\u201346 (1997)","DOI":"10.1007\/BFb0017428"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M.: Revisiting the cardinality operator and introducing cardinality-path constraint family. In: Proc. of the Int. Conf. on Logic Programming, pp. 59\u201373 (2001)","DOI":"10.1007\/3-540-45635-X_12"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"11_CR9","doi-asserted-by":"crossref","unstructured":"Hoeve, W.J.v., Pesant, G., Rousseau, L.M., Sabharwal, A.: Revisiting the sequence constraint. In: Proc. of the 12th Int. Conf. on Principles and Practice of Constraint Programming, pp. 620\u2013634 (2006)","DOI":"10.1007\/11889205_44"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-74970-7_17","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S. Brand","year":"2007","unstructured":"Brand, S., Narodytska, N., Quimper, C.G., Stuckey, P., Walsh, T.: Encodings of the sequence constraint. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 210\u2013224. Springer, Heidelberg (2007)"},{"issue":"4","key":"11_CR11","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/opre.10.4.518","volume":"10","author":"A.F. Veinott Jr.","year":"1962","unstructured":"Veinott Jr., A.F., Wagner, H.: Optimal capacity scheduling I. Operations Research\u00a010(4), 518\u2013532 (1962)","journal-title":"Operations Research"},{"key":"11_CR12","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM\u00a045, 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Solnon, C., Cung, V.D., Nguyen, A., Artigues, C.: The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF 2005 challenge problem. European Journal of Operational Research (EJOR) (in press, 2008)","DOI":"10.1016\/j.ejor.2007.04.033"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/978-3-540-48085-3_28","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"J.C. R\u00e9gin","year":"1999","unstructured":"R\u00e9gin, J.C.: Arc consistency for global cardinality constraints with costs. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 390\u2013404. Springer, Heidelberg (1999)"},{"issue":"4-5","key":"11_CR16","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10732-006-6550-4","volume":"12","author":"W.J. van Hoeve","year":"2006","unstructured":"van Hoeve, W.J., Pesant, G., Rousseau, L.M.: On global warming: Flow-based soft global constraints. J. Heuristics\u00a012(4-5), 347\u2013373 (2006)","journal-title":"J. Heuristics"},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. Journal of Computer and Systems Sciences\u00a013, 335\u2013379 (1976)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1287\/moor.5.3.321","volume":"5","author":"R. Bixby","year":"1980","unstructured":"Bixby, R., Cunningham, W.: Converting linear programs to network problems. Mathematics of Operations Research\u00a05, 321\u2013357 (1980)","journal-title":"Mathematics of Operations Research"},{"key":"11_CR19","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons, Inc., Chichester (1986)"},{"key":"11_CR20","unstructured":"Beldiceanu, N.: Global constraint catalog. T-2005-08, SICS Technical Report (2005)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/11814948_19","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"S. Cotton","year":"2006","unstructured":"Cotton, S., Maler, O.: Fast and flexible difference constraint propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 170\u2013183. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85958-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:03:50Z","timestamp":1715238230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85958-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859574","9783540859581"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85958-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}