{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:39:24Z","timestamp":1725680364028},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_10","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T03:59:40Z","timestamp":1336967980000},"page":"146-162","source":"Crossref","is-referenced-by-count":6,"title":["Explaining Flow-Based Propagation"],"prefix":"10.1007","author":[{"given":"Nicholas","family":"Downing","sequence":"first","affiliation":[]},{"given":"Thibaut","family":"Feydy","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T. Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optimization\u00a04(1), 4\u201320 (2007)","journal-title":"Discrete Optimization"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-45578-7_14","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"A. Bockmayr","year":"2001","unstructured":"Bockmayr, A., Pisaruk, N., Aggoun, A.: Network Flow Problems in Constraint Programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 196\u2013210. Springer, Heidelberg (2001)"},{"key":"10_CR3","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting Systematic Search by Weighting Constraints. In: Proc. ECAI 2004, pp. 146\u2013150 (2004)"},{"key":"10_CR4","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.J., 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":"10_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1287\/ijoc.14.4.373.2823","volume":"14","author":"B. Davey","year":"2002","unstructured":"Davey, B., Boland, N., Stuckey, P.: Efficient Intelligent Backtracking Using Linear Programming. IJOC\u00a014(4), 373\u2013386 (2002)","journal-title":"IJOC"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L. Ford","year":"1956","unstructured":"Ford, L., Fulkerson, D.: Maximal flow through a network. Canad. J. Math.\u00a08, 399\u2013404 (1956)","journal-title":"Canad. J. Math."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01593767","volume":"12","author":"J.M. Gauthier","year":"1977","unstructured":"Gauthier, J.M., Ribi\u00e8re, G.: Experiments in mixed-integer linear programming using pseudo-costs. Mathematical Programming\u00a012, 26\u201347 (1977)","journal-title":"Mathematical Programming"},{"key":"10_CR8","unstructured":"Gent, I.P.: Two Results on Car-sequencing Problems. Technical report APES-02-1998, Dept. of CS, University of Strathclyde, UK (1998)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/978-3-540-48085-3_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"I.P. Gent","year":"1999","unstructured":"Gent, I.P., Walsh, T.: CSPlib: A Benchmark Library for Constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 480\u2013481. Springer, Heidelberg (1999)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1007\/978-3-540-45193-8_64","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"E. Giunchiglia","year":"2003","unstructured":"Giunchiglia, E., Maratea, M., Tacchella, A.: (In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 842\u2013846. Springer, Heidelberg (2003)"},{"issue":"11","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1057\/palgrave.jors.2601955","volume":"56","author":"M. Gravel","year":"2005","unstructured":"Gravel, M., Gagn\u00e9, C., Price, W.L.: Review and Comparison of Three Methods for the Solution of the Car Sequencing Problem. J.O.R. Soc.\u00a056(11), 1287\u20131295 (2005)","journal-title":"J.O.R. Soc."},{"key":"10_CR12","unstructured":"Katsirelos, G.: Nogood processing in CSPs. Ph.D. thesis, University of Toronto, Canada (2008)"},{"key":"10_CR13","unstructured":"L\u00f6bel, A.: MCF 1.3 - A network simplex implementation (2004), available free of charge for academic use, \n                  \n                    http:\/\/www.zib.de\/loebel"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-85958-1_11","volume-title":"Principles and Practice of Constraint Programming","author":"M. Maher","year":"2008","unstructured":"Maher, M., Narodytska, N., Quimper, C.-G., Walsh, T.: Flow-Based Propagators for the SEQUENCE and Related Global Constraints. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 159\u2013174. Springer, Heidelberg (2008)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proc. DAC 2001, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O. Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P., Codish, M.: Propagation via lazy clause generation. Constraints\u00a014, 357\u2013391 (2009)","journal-title":"Constraints"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P. Refalo","year":"2004","unstructured":"Refalo, P.: Impact-Based Search Strategies for Constraint Programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 557\u2013571. Springer, Heidelberg (2004)"},{"key":"10_CR18","unstructured":"R\u00e9gin, J.C.: Generalized arc consistency for global cardinality constraint. In: Proc. AAA 1996, pp. 209\u2013215 (1996)"},{"key":"10_CR19","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":"10_CR20","unstructured":"Rochart, G.: Explications et programmation par contraintes avanc\u00e9e (in French). Ph.D. thesis, Universit\u00e9 de Nantes, France (2005)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","first-page":"321","volume-title":"Parallel Computing Technologies","author":"B. Smith","year":"1997","unstructured":"Smith, B.: Succeed-first or Fail-first: A Case Study in Variable and Value Ordering. In: Malyshkin, V.E. (ed.) PaCT 1997. LNCS, vol.\u00a01277, pp. 321\u2013330. Springer, Heidelberg (1997)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Steiger, R., van Hoeve, W.J., Szymanek, R.: An efficient generic network flow constraint. In: Proc. SAC 2011, pp. 893\u2013900 (2011)","DOI":"10.1145\/1982185.1982381"},{"issue":"2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-First Search and Linear Graph Algorithms. SIAM J. Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM J. Computing"},{"key":"10_CR24","unstructured":"Vanhoucke, M., Maenhout, B.: NSPLib \u2013 A Nurse Scheduling Problem Library: A tool to evaluate (meta-)heuristic procedures. In: Proc. ORAHS 2005 (2005)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:37:47Z","timestamp":1558298267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}