1. Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7), 57–73.
2. Akplogan, M., de Givry, S., Métivier, J.-P., Quesnel, G., Joannon, A., Garcia, F. (2013). Solving the crop allocation problem using hard and soft constraints. RAIRO - Operations Research, 47(2), 151–172.
3. Allouche, D., Bessière, C., Boizumault, P., de Givry, S., Gutierrez, P., Loudni, S., Métivier, J.-P., Schiex, T. (2012). Filtering decomposable global cost functions. In Proceedings of AAAI’12, (pp. 407–413).
4. Allouche, D., Traoré, S., André, I., de Givry, S., Katsirelos, G., Barbe, S., Schiex, T. (2012). Computational protein design as a cost function network optimization problem. In Proceedings of CP’12, (pp. 840–849).
5. Beldiceanu, N., Carlsson, M., Rampon, J.X. (2005). Global constraint catalog. Technical Report T2005- 08, Swedish Institute of Computer Science. http://www.emn.fr/x-info/sdemasse/gccat/ .