
## Acknowledgements

We thank Eric Bourreau for having provided the data for the problem of the master of computer science of the university of Montpellier. We also thank our **reviewers for their** helpful comments which improved this paper.

## References

[1] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network flows**. Prentice Hall, Upper**
Saddle River NJ, 1993.

[2] N. Beldiceanu. Global constraints as graph properties on a structured network of elementary constraints of the same type. Technical report, Swedish Institute of Computer Science, 2000. SICS Technical Report T2000/01.

[3] N. Beldiceanu. Pruning for the minimum constraint family and for the number of distinct values constraint family. In T. Walsh, editor, CP, volume 2239 of **Lecture** Notes in Computer Science**, pages 211–224. Springer, 2001.**
[4] N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. **Mathl.**
Comput. Modelling**, 20:97–123, no. 12 1994.**
[5] N. Beldiceanu, I. Katriel, and S. Thiel. Filtering algorithms for the same and **usedby**
constraints. In MPI Technical Report MPI-I-2004-1-001**, 2004.**

[6] C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh. Among, common and disjoint constraints. In B. Hnich, M. Carlsson, F. Fages, and F. Rossi, editors, CSCLP, volume 3978 of Lecture Notes in Computer Science**, pages 29–43. Springer,** 2005.
[7] C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh. Filtering algorithms for the NVALUE constraint. Constraints**, 11(4):271–293, 2006.**
[8] C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh. Filtering algorithms for the NVALUE constraint. In R. Bartak and M. Milano, editors, CPAIOR**, volume**
3524 of Lecture Notes in Computer Science**, pages 79–93. Springer, 2005.**
[9] C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh. The RANGE and ROOTS constraints: some applications. Technical report COMIC-2006-003, 2006.

[10] C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh. The **RANGE and**
ROOTS constraints: Specifying counting and occurrence problems. In L.P. Kaelbling and A. Saffiotti, editors, IJCAI**, pages 60–65. Professional Book Center, 2005.**
[11] C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh. The **RANGE constraint: Algorithms and implementation. In J.C. Beck and B.M. Smith, editors,**
CPAIOR, volume 3990 of Lecture Notes in Computer Science**, pages 59–73. Springer,** 2006.