G. Pesant and J. Régin, SPREAD: A Balancing Constraint Based on Statistics, CP 2005, pp.460-474, 2005.
DOI : 10.1007/11564751_35

P. Schaus, Y. Deville, and P. Dupont, Bound-Consistent Deviation Constraint, CP 2007, pp.620-634, 2007.
DOI : 10.1007/978-3-540-74970-7_44

T. Petit, J. Régin, and N. Beldiceanu, A ??(n) Bound-Consistency Algorithm for the Increasing Sum Constraint, CP 2011, pp.721-728, 2011.
DOI : 10.1007/978-3-642-23786-7_54

URL : https://hal.archives-ouvertes.fr/hal-00753385

J. Puget, Improved Bound Computation in Presence of Several Clique Constraints, CP 2004, pp.527-541, 2004.
DOI : 10.1007/978-3-540-30201-8_39

J. Régin and T. Petit, The Objective Sum Constraint, CPAIOR 2011, pp.190-195, 2011.
DOI : 10.1007/978-3-642-21311-3_18

C. Schulte and P. J. Stuckey, When do bounds and domain propagation lead to the same search space?, ACM Transactions on Programming Languages and Systems, vol.27, issue.3, pp.388-425, 2005.
DOI : 10.1145/1065887.1065889

C. Choi, W. Harvey, J. Lee, and P. Stuckey, Finite Domain Bounds Consistency Revisited, Advances in Artificial Intelligence LNCS, vol.4304, pp.49-58, 2006.
DOI : 10.1007/11941439_9

N. Razakarison, N. Beldiceanu, M. Carlsson, and H. Simonis, GAC for a linear inequality and an Atleast constraint with an application to learning simple polynomials, SoCS, vol.2013, pp.149-157, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00874297

W. Harvey and J. Schimpf, Bounds consistency techniques for long Linear constraints, Proceedings of TRICS 2002, the workshop on Techniques foR Implementing Constraint programming Systems, pp.39-46, 2002.

P. Schaus and J. Régin, Bound-consistent Spread constraint, application to load balancing in nurse-to-patient assignments, EURO Journal on Computational Optimization, pp.1-24, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01345924

K. Murota, Recent Developments in Discrete Convex Analysis, Research Trends in Combinatorial Optimization, pp.219-260, 2009.
DOI : 10.1007/978-3-540-76796-1_11

S. Fujishige, Submodular Functions and Optimization, Annals of Discrete Mathematics, 2005.

N. Beldiceanu and E. Contejean, Introducing global constraints in CHIP, Mathematical and Computer Modelling, vol.20, issue.12, pp.97-123, 1994.
DOI : 10.1016/0895-7177(94)90127-9

URL : https://hal.archives-ouvertes.fr/hal-00442810

C. Bessì-ere, E. Hebrard, B. Hnich, Z. K?z?ltan, and T. Walsh, Among, Common and Disjoint constraints, CSCLP 2005; Revised Selected and Invited Papers, pp.28-43, 2006.

P. Schaus, Solving balancing and bin-packing problems with constraint programming, 2009.

I. P. Gent, The recomputation manifesto, CoRR abs/1304

T. Petit, N. Beldiceanu, and X. Lorca, A generalized arc-consistency algorithm for a class of counting constraints, pp.643-648, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00754017

G. Katsirelos, N. Narodytska, and T. Walsh, The SeqBin Constraint Revisited, CP 2012, pp.332-347, 2012.
DOI : 10.1007/978-3-642-33558-7_26

J. Régin, Cost-based arc consistency for global cardinality constraints, Constraints, vol.7, pp.3-4, 2002.

Y. Deville, O. Barette, and P. Van-hentenryck, Constraint satisfaction over connected row-convex constraints, Artificial Intelligence, vol.109, issue.1-2, pp.1-2, 1999.
DOI : 10.1016/S0004-3702(99)00012-0

URL : http://doi.org/10.1016/s0004-3702(99)00012-0

Y. Zhang and E. C. Freuder, Properties of tree convex constraints, Artificial Intelligence, vol.172, issue.12-13, pp.12-13, 2008.
DOI : 10.1016/j.artint.2008.05.001

M. A. Trick, A dynamic programming approach for consistency and propagation for knapsack constraints, Annals of Operations Research, vol.118, pp.1-4, 2003.

G. Pesant, Achieving Domain Consistency and Counting Solutions for Dispersion Constraints, INFORMS Journal on Computing, vol.27, issue.4, pp.690-703, 2015.
DOI : 10.1287/ijoc.2015.0654

S. C. Loong, W. Ku, and J. C. Beck, Q-bounds consistency for the spread constraint with variable mean, Constraints, pp.1-7, 2016.