Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference18 articles.
1. Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer, Boston, MA.
2. Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4: 238–252.
3. Cambazard, H., Hladik, P.-E., Déplanche, A.-M., Jussien, N., & Trinquet, Y. (2004). Decomposition and learning for a hard real time task allocation algorithm. In Wallace, M., ed., Principles and Practice of Constraint Programming (CP 2004), Lect. Notes Comput. Sci. 3258. Springer, Berlin.
4. de Siqueira N, J. L., & Puget, J.-F. (1988). In Explanation-Based Generalisation of Failures, European Conference on Artificial Intelligence (ECAI-88), pages 339–344. Pitman Publishers, Munich.
5. Eremin, A., & Wallace, M. (2001). Hybrid Benders decomposition algorithms in constraint logic programming. In Walsh, T., ed., Principles and Practice of Constraint Programming (CP 2001), Lect. Notes Comput. Sci., 2239, pages 318–325. Springer, Berlin.
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献