{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:26:41Z","timestamp":1742912801888,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319180076"},{"type":"electronic","value":"9783319180083"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18008-3_29","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T07:32:51Z","timestamp":1429083171000},"page":"427-436","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Understanding the Potential of Propagators"],"prefix":"10.1007","author":[{"given":"Sascha","family":"Van Cauwelaert","sequence":"first","affiliation":[]},{"given":"Michele","family":"Lombardi","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"issue":"7","key":"29_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending chip in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling 17(7), 57\u201373 (1993)","journal-title":"Mathematical and Computer Modelling"},{"issue":"1\u20132","key":"29_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1009822502231","volume":"5","author":"P Baptiste","year":"2000","unstructured":"Baptiste, P., Le Pape, C.: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints 5(1\u20132), 119\u2013139 (2000)","journal-title":"Constraints"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems, vol. 39. Springer (2001)","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-46135-3_5","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"N Beldiceanu","year":"2002","unstructured":"Beldiceanu, N., Carlsson, M.: A new multi-resource $$cumulatives$$ constraint with negative heights. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 63\u201379. Springer, Heidelberg (2002)"},{"issue":"12","key":"29_CR5","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. Mathematical and computer Modelling 20(12), 97\u2013123 (1994)","journal-title":"Mathematical and computer Modelling"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1613\/jair.4199","volume":"50","author":"D Bergman","year":"2014","unstructured":"Bergman, D., Cir\u00e9, A.A., van Hoeve, W.J.: MDD propagation for sequence constraints. J. Artif. Intell. Res. (JAIR) 50, 697\u2013722 (2014)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-19754-3_23","volume-title":"Theory and Practice of Algorithms in (Computer) Systems","author":"T Berthold","year":"2011","unstructured":"Berthold, T., Heinz, S., Schulz, J.: An approximative criterion for the potential of energetic reasoning. In: Marchetti-Spaccamela, A., Segal, M. (eds.) TAPAS 2011. LNCS, vol. 6595, pp. 229\u2013239. Springer, Heidelberg (2011)"},{"key":"29_CR8","unstructured":"Bessi\u00e8re, C., Debruyne, R.: Optimal and suboptimal singleton arc consistency algorithms. In: IJCAI-2005, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30-August 5, 2005, pp. 54\u201359 (2005)"},{"key":"29_CR9","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. 4741, pp. 210\u2013224. Springer, Heidelberg (2007)"},{"key":"29_CR10","unstructured":"Van Cauwelaert, S., Lombardi, M., Schaus, P.: Supervised learning to control energetic reasoning: feasibility study. In: Proceedings of the Doctoral Program CP2014 (2014)"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10601-009-9087-y","volume":"15","author":"KCK Cheng","year":"2010","unstructured":"Cheng, K.C.K., Yap, R.H.C.: An mdd-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints 15(2), 265\u2013304 (2010)","journal-title":"Constraints"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-319-10428-7_22","volume-title":"Principles and Practice of Constraint Programming","author":"A Derrien","year":"2014","unstructured":"Derrien, A., Petit, T.: A new characterization of relevant intervals for energetic reasoning. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 289\u2013297. Springer, Heidelberg (2014)"},{"issue":"2","key":"29_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Mathematical programming 91(2), 201\u2013213 (2002)","journal-title":"Mathematical programming"},{"key":"29_CR14","unstructured":"Erschler, J., Lopez, P.: Energy-based approach for task scheduling under time and resources constraints. In: 2nd international workshop on project management and scheduling, pp. 115\u2013121 (1990)"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Kolisch, R., Schwindt, C., Sprecher, A.: Benchmark instances for project scheduling problems. In: Project Scheduling, pp. 197\u2013212. Springer (1999)","DOI":"10.1007\/978-1-4615-5533-9_9"},{"key":"29_CR16","unstructured":"Le Pape, C., Couronn\u00e9, P., Vergamini, D., Gosselin, V.: Time-Versus-Capacity Compromises in Project Scheduling. (1994)"},{"key":"29_CR17","unstructured":"OscaR Team. OscaR: Scala in OR (2012). https:\/\/bitbucket.org\/oscarlib\/oscar"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-40627-0_43","volume-title":"Principles and Practice of Constraint Programming","author":"F Pelsser","year":"2013","unstructured":"Pelsser, F., Schaus, P., R\u00e9gin, J.-C.: Revisiting the cardinality reasoning for binpacking constraint. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 578\u2013586. Springer, Heidelberg (2013)"},{"key":"29_CR19","unstructured":"Schaus, P. et al.: Solving balancing and bin-packing problems with constraint programming. PhD thesis, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve (2009)"},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-540-30201-8_47","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Shaw","year":"2004","unstructured":"Shaw, P.: A constraint for bin packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648\u2013662. Springer, Heidelberg (2004)"},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/11889205_44","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"W-J van Hoeve","year":"2006","unstructured":"van Hoeve, W.-J., Pesant, G., Rousseau, L.-M., Sabharwal, A.: Revisiting the sequence constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 620\u2013634. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18008-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,30]],"date-time":"2020-12-30T20:07:53Z","timestamp":1609358873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18008-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180076","9783319180083"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18008-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}