 | Monter d'un niveau |
Verhaeghe, H., Nijssen, S., Pesant, G., Quimper, C.-G., & Schaus, P. (2020). Learning optimal decision trees using constraint programming. Constraints, 25(3-4), 226-250. Lien externe
Pesant, G., Quimper, C.-G., & Zanarini, A. (2012). Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems. Journal of Artificial Intelligence Research, 43, 173-210. Lien externe
Côté, M.-C., Gendron, B., Quimper, C.-G., & Rousseau, L.-M. (2011). Formal languages for integer programming modeling of shift scheduling problems. Constraints, 16(1), 54-76. Lien externe
Quimper, C.-G., & Rousseau, L.-M. (2010). A large neighbourhood search approach to the multi-activity shift scheduling problem. Journal of Heuristics, 16(3), 373-392. Lien externe
Quimper, C.-G., & Rousseau, L.-M. (2007). A large neighbourhood search approach to the multi-activity shift scheduling problem. (Rapport technique n° CIRRELT-2007-56). Lien externe
Pesant, G., Quimper, C.-G., & Verhaeghe, H. (juin 2022). Practically uniform solution sampling in constraint programming [Communication écrite]. 19th International Conference on Integration of Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR 2022), Los Angeles, CA, USA. Lien externe
Verhaeghe, H. , Nijssen, S., Pesant, G., Quimper, C.-G., & Schaus, P. (juin 2021). Learning Optimal Decision Trees using Constraint Programming [Communication écrite]. 16th French-Speaking Conference on Constraint Programming (JFPC 2021). Non disponible
Verhaeghe, H., Nijssen, S., Pesant, G., Quimper, C.-G., & Schaus, P. (janvier 2021). Learning optimal decision trees using constraint programming (extended abstract) [Communication écrite]. 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), Yokohama, Japan. Lien externe
Babaki, B., Pesant, G., & Quimper, C.-G. (mai 2020). Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search [Communication écrite]. 13th International Symposium on Combinatorial Search (SOCS 2020), Vienna, Austria. Publié dans Proceedings of the International Symposium on Combinatorial Search, 11(1). Lien externe
Hà, M. H., Quimper, C.-G., & Rousseau, L.-M. (août 2015). General Bounding Mechanism for Constraint Programs [Communication écrite]. 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland. Lien externe
Pesant, G., & Quimper, C.-G. (mai 2008). Counting solutions of knapsack constraints [Communication écrite]. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), Paris, France. Lien externe
Quimper, C.-G., & Walsh, T. (juillet 2008). Decompositions of grammar constraints [Communication écrite]. 23rd AAAI Conference on Artificial Intelligence and the 20th Innovative Applications of Artificial Intelligence Conference, AAAI-08/IAAI-08, Chicago, IL, United states. Non disponible
Maher, M., Narodytska, N., Quimper, C.-G., & Walsh, T. (septembre 2008). Flow-based propagators for the SEQUENCE and related global constraints [Communication écrite]. 14th International Conference on Principles and Practice of Constraint Programming, CP 2008, Sydney, NSW, Australia. Lien externe
Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Quimper, C.-G., & Walsh, T. (juillet 2008). The parameterized complexity of global constraints [Communication écrite]. 23rd AAAI Conference on Artificial Intelligence and the 20th Innovative Applications of Artificial Intelligence Conference, AAAI 08/IAAI 08. Lien externe
Côté, M.-C., Gendron, B., Quimper, C.-G., & Rousseau, L.-M. (2007). Formal languages for integer programming modeling of shift scheduling problems. (Document de travail n° CIRRELT-2007-64). Lien externe
