1. Aggoun, A. and Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Mathl Comput. Modelling,17(7):57–73.
2. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network flows : theory, algorithms and applications. Prentice Hall.
3. Althaus, E., Bockmayr, A., Elf, M., Kasper, T., Jünger, M., and Mehlhorn, K. (2002). SCIL - Symbolic Constraints in Integer Linear Programming. In 10th European Symposium on Algorithms, ESA’02, Rome, pages 75–87. Springer, LNCS 2461.
4. Baptiste, P., Pape, C. L., and Nuijten, W. (2001). Constraint-Based Scheduling, volume 39 of International Series in Operations Research and Management Science. Kluwer.
5. Beldiceanu, N. and Contejean, E. (1994). Introducing global constraints in CHIP. Mathl. Comput. Modelling, 20(12):97–123.