Author:
Cauwelaert Sascha Van,Lombardi Michele,Schaus Pierre
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference61 articles.
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. Ait-Kaci, H., & Des Flambertins, F. (1999). Warren’s abstract machine—a tutorial reconstruction (pp. 114). Cambridge: MIT Press Cambridge.
3. Baptiste, P., & Le Pape, C. (2000). Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints, 5(1–2), 119–139.
4. Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling: applying constraint programming to scheduling problems. In International Series in Operations Research & Management Science (Vol. 39). Springer, Berlin.
5. Beldiceanu, N., & Contejean, E. (1994). Introducing global constraints in CHIP. Mathematical and Computer Modelling, 20(12), 97–123.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献