{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:20:24Z","timestamp":1725747624886},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406263"},{"type":"electronic","value":"9783642406270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40627-0_40","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T03:11:01Z","timestamp":1378523461000},"page":"529-544","source":"Crossref","is-referenced-by-count":2,"title":["A Parametric Propagator for Discretely Convex Pairs of Sum Constraints"],"prefix":"10.1007","author":[{"given":"Jean-No\u00ebl","family":"Monette","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Beldiceanu","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Flener","sequence":"additional","affiliation":[]},{"given":"Justin","family":"Pearson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"12","key":"40_CR1","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\u00a020(12), 97\u2013123 (1994)","journal-title":"Mathematical and Computer Modelling"},{"key":"40_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/11754602_3","volume-title":"Recent Advances in Constraints","author":"C. Bessi\u00e8re","year":"2006","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Among, common and disjoint constraints. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) CSCLP 2005. LNCS (LNAI), vol.\u00a03978, pp. 29\u201343. Springer, Heidelberg (2006)"},{"key":"40_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-33558-7_16","volume-title":"Principles and Practice of Constraint Programming","author":"A. Bonfietti","year":"2012","unstructured":"Bonfietti, A., Lombardi, M.: The weighted average constraint. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 191\u2013206. Springer, Heidelberg (2012)"},{"key":"40_CR4","unstructured":"Fujishige, S.: Submodular Functions and Optimization. In: Annals of Discrete Mathematics, 2nd edn., Elsevier (2005)"},{"key":"40_CR5","unstructured":"Gent, I.P.: The recomputation manifesto. CoRR, abs\/1304.3674 (2013)"},{"key":"40_CR6","unstructured":"Harvey, W., Schimpf, J.: Bounds consistency techniques for long linear constraints. In: Proceedings of TRICS 2002, the Workshop on Techniques foR Implementing Constraint programming Systems, pp. 39\u201346 (2002)"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Murota, K.: Recent developments in discrete convex analysis. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 219\u2013260. Springer (2009)","DOI":"10.1007\/978-3-540-76796-1_11"},{"key":"40_CR8","unstructured":"OscaR Team. OscaR: Scala in OR (2012), \n                    \n                      https:\/\/bitbucket.org\/oscarlib\/oscar"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/11564751_35","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"G. Pesant","year":"2005","unstructured":"Pesant, G., R\u00e9gin, J.-C.: SPREAD: A balancing constraint based on statistics. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 460\u2013474. Springer, Heidelberg (2005)"},{"key":"40_CR10","unstructured":"Petit, T., Beldiceanu, N., Lorca, X.: A generalized arc-consistency algorithm for a class of counting constraints. In: IJCAI 2011, pp. 643\u2013648. AAAI Press (2011), revised edition available at \n                    \n                      http:\/\/arxiv.org\/abs\/1110.4719"},{"key":"40_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/978-3-642-23786-7_54","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"T. Petit","year":"2011","unstructured":"Petit, T., R\u00e9gin, J.-C., Beldiceanu, N.: A \u0398(n) bound-consistency algorithm for the increasing sum constraint. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 721\u2013728. Springer, Heidelberg (2011)"},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-540-30201-8_39","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"J.-F. Puget","year":"2004","unstructured":"Puget, J.-F.: Improved bound computation in presence of several clique constraints. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 527\u2013541. Springer, Heidelberg (2004)"},{"key":"40_CR13","unstructured":"Razakarison, N., Beldiceanu, N., Carlsson, M., Simonis, H.: GAC for a linear inequality and an atleast constraint with an application to learning simple polynomials. In: SoCS 2013, AAAI Press (2013)"},{"issue":"3-4","key":"40_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1020506526052","volume":"7","author":"J.-C. R\u00e9gin","year":"2002","unstructured":"R\u00e9gin, J.-C.: Cost-based arc consistency for global cardinality constraints. Constraints\u00a07(3-4), 387\u2013405 (2002)","journal-title":"Constraints"},{"key":"40_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-21311-3_18","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J.-C. R\u00e9gin","year":"2011","unstructured":"R\u00e9gin, J.-C., Petit, T.: The objective sum constraint. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol.\u00a06697, pp. 190\u2013195. Springer, Heidelberg (2011)"},{"key":"40_CR16","unstructured":"Schaus, P.: Solving balancing and bin-packing problems with constraint programming, PhD Thesis, Universit\u00e9 catholique de Louvain, Belgium (2009)"},{"key":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-540-74970-7_44","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"P. Schaus","year":"2007","unstructured":"Schaus, P., Deville, Y., Dupont, P.: Bound-consistent deviation constraint. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 620\u2013634. Springer, Heidelberg (2007)"},{"key":"40_CR18","unstructured":"Schaus, P., R\u00e9gin, J.-C.: Bound-consistent spread constraint, application to load balancing in nurse to patient assignments (submitted)"},{"issue":"3","key":"40_CR19","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/1065887.1065889","volume":"27","author":"C. Schulte","year":"2005","unstructured":"Schulte, C., Stuckey, P.J.: When do bounds and domain propagation lead to the same search space? ACM Transactions on Programming Languages and Systems\u00a027(3), 388\u2013425 (2005)","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40627-0_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T22:18:17Z","timestamp":1558045097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}