{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:09:42Z","timestamp":1743106182841,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319339535"},{"type":"electronic","value":"9783319339542"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-33954-2_9","type":"book-chapter","created":{"date-parts":[[2016,5,11]],"date-time":"2016-05-11T07:00:09Z","timestamp":1462950009000},"page":"108-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Forward-Checking Filtering for Nested Cardinality Constraints: Application to an Energy Cost-Aware Production Planning Problem for Tissue Manufacturing"],"prefix":"10.1007","author":[{"given":"Cyrille","family":"Dejemeppe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Devolder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Lecomte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,12]]},"reference":[{"key":"9_CR1","unstructured":"de Saint-Marcq, V.l.C., Schaus, P., Solnon, C., Lecoutre, C.: Sparse-sets for domain implementation. In: Techniques for Implementing Constraint Programming Systems (TRICS) Workshop at CP 2013 (2013)"},{"issue":"2","key":"9_CR2","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. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-319-23219-5_10","volume-title":"Principles and Practice of Constraint Programming","author":"S Gay","year":"2015","unstructured":"Gay, S., Hartert, R., Lecoutre, C., Schaus, P.: Conflict ordering search for scheduling problems. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 140\u2013148. Springer, Heidelberg (2015)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-30201-8_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"L Hellsten","year":"2004","unstructured":"Hellsten, L., Pesant, G., van Beek, P.: A domain consistency algorithm for the stretch constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 290\u2013304. Springer, Heidelberg (2004)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/978-3-319-10428-7_29","volume-title":"Principles and Practice of Constraint Programming","author":"VR Houndji","year":"2014","unstructured":"Houndji, V.R., Schaus, P., Wolsey, L., Deville, Y.: The stockingcost constraint. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 382\u2013397. Springer, Heidelberg (2014)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-74970-7_30","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"MZ Lagerkvist","year":"2007","unstructured":"Lagerkvist, M.Z., Schulte, C.: Advisors for incremental propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 409\u2013422. Springer, Heidelberg (2007)"},{"key":"9_CR7","unstructured":"OR-Tools Team, Laurent Perron. OR-TOOLS (2010). \n                    https:\/\/developers.google.com\/optimization\/"},{"key":"9_CR8","unstructured":"OscaR Team. OscaR: Scala in OR (2012). \n                    https:\/\/bitbucket.org\/oscarlib\/oscar"},{"key":"9_CR9","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. 3258, pp. 482\u2013495. Springer, Heidelberg (2004)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-540-45193-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"C-G Quimper","year":"2003","unstructured":"Quimper, C.-G., van Beek, P., L\u00f3pez-Ortiz, A., Golynski, A., Sadjad, S.B.S.: An efficient bounds consistency algorithm for the global cardinality constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 600\u2013614. Springer, Heidelberg (2003)"},{"key":"9_CR11","unstructured":"R\u00e9gin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, vol. 1, AAAI 1996, pp. 209\u2013215. AAAI Press (1996)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Schaus, P., Variable objective large neighborhood search: a practical approach to solve over-constrained problems. In: 2013 IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 971\u2013978. IEEE (2013)","DOI":"10.1109\/ICTAI.2013.147"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-642-40627-0_46","volume-title":"Principles and Practice of Constraint Programming","author":"P Schaus","year":"2013","unstructured":"Schaus, P., Hartert, R.: Multi-objective large neighborhood search. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 611\u2013627. Springer, Heidelberg (2013)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-19486-3_5","volume-title":"Recent Advances in Constraints","author":"H Simonis","year":"2011","unstructured":"Simonis, H., Hadzic, T.: A resource cost aware cumulative. In: Larrosa, J., O\u2019Sullivan, B. (eds.) CSCLP 2009. LNCS, vol. 6384, pp. 76\u201389. Springer, Heidelberg (2011)"},{"key":"9_CR15","unstructured":"Smith, B.M.: Modelling for constraint programming. In: Lecture Notes for the First International Summer School on Constraint Programming (2005)"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM (JACM) 22(2), 215\u2013225 (1975)","journal-title":"J. ACM (JACM)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/978-3-319-18008-3_29","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"S Cauwelaert Van","year":"2015","unstructured":"Van Cauwelaert, S., Lombardi, M., Schaus, P.: Understanding the potential of propagators. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 427\u2013436. Springer, Heidelberg (2015)"},{"key":"9_CR18","unstructured":"Van Hentenryck, P., Carillon, J.-P., Generality versus specificity: an experience with ai and or techniques. In: AAAI, pp. 660\u2013664 (1988)"},{"issue":"13","key":"9_CR19","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1016\/j.enpol.2004.07.013","volume":"34","author":"R Wtenhagen","year":"2006","unstructured":"Wtenhagen, R., Bilharz, M.: Green energy market development in germany: effective public policy and emerging customer demand. Energy Policy 34(13), 1681\u20131696 (2006)","journal-title":"Energy Policy"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-72397-4_26","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A Zanarini","year":"2007","unstructured":"Zanarini, A., Pesant, G.: Generalizations of the global cardinality constraint for hierarchical resources. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 361\u2013375. Springer, Heidelberg (2007)"}],"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-33954-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:43:55Z","timestamp":1558313035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33954-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319339535","9783319339542"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33954-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"12 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}