Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems, Mathl. Comput. Modelling 17(7), 57–73 (1993).
2. Beldiceanu, N., Contejean, E.: Introducing global constraint in CHIP. Mathl. Comput. Modelling Vol. 20, No. 12, 97–123 (1994).
3. Beldiceanu, N.: Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type. SICS Technical Report T2000/01, (2000).
4. Beldiceanu, N.: Sweep as a generic pruning technique. SICS Technical Report T2000/08, (2000).
5. Beldiceanu, N.: Pruning for the minimum constraint family and for the number of distinct values constraint family. SICS Technical Report T2000/10, (2000).
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献