 | Monter d'un niveau |
Abdelilah, S., Guéhéneuc, Y.-G., & Pesant, G. (juin 2011). CP-SST : approche basée sur la programmation par contraintes pour le test structurel du logiciel [Communication écrite]. 7es Journées francophones de programmation par contraintes, Lyon, France. Non disponible
Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2011). Checking the feasibility of dial-a-ride instances using constraint programming. Transportation Science, 45(3), 399-412. Lien externe
Bhattacharya, N., Sakti, A., Antoniol, G., Guéhéneuc, Y.-G., & Pesant, G. (septembre 2011). Divide-by-zero exception raising via branch coverage [Communication écrite]. 3rd International Symposium on Search Based Software Engineering (SSBSE 2011), Szeged, Hungary. Lien externe
Bhattacharya, N., Sakti, A., Antoniol, G., Guéhéneuc, Y.-G., & Pesant, G. (mars 2011). Performance analysis of metaheuristic and constraint programming approaches [Communication écrite]. 4th International conference on Software Testing, Verification and Validation, Berlin, Germany. Non disponible
Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2011). Using local search to speed up filtering algorithms for some NP-hard constraints. Annals of Operations Research, 184(1), 121-135. Lien externe
Lodi, A., Pesant, G., & Rousseau, L.-M. (mai 2011). On counting lattice points and chvatal-gomory cutting planes [Communication écrite]. 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011), Berlin, Germany. Lien externe
Meignan, D., Frayret, J.-M., & Pesant, G. (octobre 2011). An interactive heuristic approach for the P-forest problem [Communication écrite]. IEEE International Conference on Systems, Man, and Cybernetics (SMC 2011), Anchorage, AK, United states. Lien externe
Pesant, G., & Zanarini, A. (mai 2011). Recovering indirect solution densities for counting-based branching heuristics [Communication écrite]. 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011), Berlin, Germany. Lien externe
