 | Monter d'un niveau |
Gilles PesantDépartement de génie informatique et génie logiciel
Voir sa fiche dans le Répertoire des Expertises de Polytechnique Montréal
Réseau de collaborationCe graphique trace les liens entre tous les collaborateurs des publications de {} figurant sur cette page.
Chaque lien représente une collaboration sur la même publication. L'épaisseur du lien représente le nombre de collaborations.
Utilisez la molette de la souris ou les gestes de défilement pour zoomer à l'intérieur du graphique.
Vous pouvez cliquer sur les noeuds et les liens pour les mettre en surbrillance et déplacer les noeuds en les glissant.
Enfoncez la touche "Ctrl" ou la touche "⌘" en cliquant sur les noeuds pour ouvrir la liste des publications de cette personne.
Azéma, M., Desaulniers, G., Mendoza, J. E., & Pesant, G. (mai 2024). A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints [Communication écrite]. 21st International Conference on Integration of Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR 2024), Uppsala, Sweden. Lien externe
Aalian, Y., Gamache, M., & Pesant, G. (2024). Short-term underground mine planning with uncertain activity durations using constraint programming. Journal of Scheduling, 17 pages. Lien externe
Aalian, Y., Pesant, G., & Gamache, M. (août 2023). Optimization of Short-Term Underground Mine Planning Using Constraint Programming [Communication écrite]. 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), Toronto, ON, Canada (16 pages). Lien externe
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
André, M., Pesant, G., & Pierre, S. (2005). A variable neighborhood search algorithm for assigning cells to switches in wireless networks. Journal of Computer Science, 1(2), 175-181. Disponible
Amoussou, G., Andre, M., Pesant, G., & Pierre, S. (2003). Une approche basée sur la programmation par contraintes pour affecter des cellules à des commutateurs dans les réseaux cellulaires pour mobiles. [A constraint programming approach to assign cells to switches in personal communication networks]. Annales des télécommunications, 58(3-4), 584-604. Lien externe
Amoussou, G., André, M., Pesant, G., & Pierre, S. (mai 2002). Affectation de cellules à des commutateurs dans les réseaux cellulaires mobiles par programmation par contraintes [Communication écrite]. Canadian Conference on Electrical and Computer Engineering (CCECE 2002), Winnipeg, Manitoba. Non disponible
André, M., Pesant, G., & Pierre, S. (mai 2002). Une approche basée sur la programmation par contraintes pour affecter des cellules à des commutateurs dans les réseaux cellulaires pour mobiles [A constraint programming approach for the assignment of cells to switches in a mobile communication network]. [Communication écrite]. Journées de l'optimisation/Optimization Days 2002, Montréal, Québec. Non disponible
André, M., Pesant, G., & Pierre, S. (janvier 2002). Using tabu search for assigning cells to switches in mobile cellular networks [Communication écrite]. 21st Biennal Symposium on Communications, Kingston. Non disponible
Amoussou, G., Pesant, G., & Pierre, S. (mai 2001). Affectation de cellules à des commutateurs par programmation par contraintes [Communication écrite]. Canadian Conference on Electrical and Computer Engineering (CCECE 2001), Toronto, Ont., Canada. Lien externe
André, M., Amoussou, G., Pierre, S., & Pesant, G. (mai 2001). An exact constraint programming algorithm for the assignment of cells to switches in a mobile communication network [Présentation]. Dans 43e Congrès annuel de la Société canadienne de recherche opérationnelle (SCRO), conjointement avec les Journées de l'optimisation (SCRO-JOPT 2001), Québec, Québec. Non disponible
Bofill, M., Coll, J., Garcia, M., Giráldez-Cru, J., Pesant, G., Suy, J., & Villaret, M. (août 2023). Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem (Extended Abstract) [Résumé]. 32nd International Joint Conference on Artificial Intelligence, Macao. Lien externe
Burlats, A., & Pesant, G. (juillet 2023). Exploiter l'entropie pour la programmation par contraintes [Exploiting entropy in constraint programming]. [Communication écrite]. 18es Journées francophones de programmation par contraintes (JFPC 2023), Strasbourg, France. Lien externe
Burlats, A., & Pesant, G. (mai 2023). Exploiting Entropy in Constraint Programming [Communication écrite]. 20th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023), Nice, France. Lien externe
Bofill, M., Coll, J., Garcia, M., Giraldez-Cru, J., Pesant, G., Suy, J., & Villaret, M. (2022). Constraint solving approaches to the business-to-business meeting scheduling problem. Journal of Artificial Intelligence Research, 74, 263-301. Lien externe
Babaki, B., Omrani, B., & Pesant, G. (septembre 2020). Combinatorial Search in CP-Based Iterated Belief Propagation [Communication écrite]. 26th International Conference on Principles and Practice of Constraint Programming, Louvain-la-Neuve, Belgium. Lien externe
Babaki, B., & Pesant, G. (novembre 2020). Parallel Planning using a Lazy Clause Generation Solver [Communication écrite]. 32nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2020). 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
Bianco, G. L., Lorca, X., Truchet, C., & Pesant, G. (2019). Revisiting counting solutions for the global cardinality constraint. Journal of Artificial Intelligence Research, 66, 411-441. Lien externe
Brockbank, S., Pesant, G., & Rousseau, L.-M. (septembre 2013). Counting spanning trees to guide search in constrained spanning tree problems [Communication écrite]. 19th International Conference on Principles and Practice of Constraint Programming (CP 2013), Uppsala, Sweden. Lien externe
Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2012). Feasibility of the pickup and delivery problem with fixed partial routes: A complexity analysis. Transportation Science, 46(3), 359-373. Lien externe
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
Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2010). Checking the Feasibility of Dial-a-Ride Instances using Constraint Programming. (Rapport technique n° CIRRELT-2010-16). Lien externe
Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2010). Feasibility of the pickup and delivery problem with fixed partial routes: A complexity Analysis. (Rapport technique n° CIRRELT-2010-15). Lien externe
Boivin, S., Gendron, B., & Pesant, G. (2008). A load balancing procedure for parallel constraint programming. (Rapport technique n° CIRRELT-2008-32). Lien externe
Bourdais, S., Galinier, P., & Pesant, G. (septembre 2003). HIBISCUS: a constraint programming application to staff scheduling in health care [Communication écrite]. 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland. Lien externe
Bourjolly, J.-M., Laporte, G., & Pesant, G. (2002). An exact algorithm for the maximum k-club problem in an undirected graph. European Journal of Operational Research, 138(1), 21-28. Lien externe
Bourjolly, J. M., Laporte, G., & Pesant, G. (2000). Heuristics for Finding k-Clubs in an Undirected Graph. Computers & Operations Research, 27(6), 559-569. Lien externe
Coste, P., Lodi, A., & Pesant, G. (juin 2019). Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems [Communication écrite]. 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2019), Thessaloniki, Greece. Lien externe
Doulabi, H. H., Pesant, G., & Rousseau, L.-M. (2020). Vehicle Routing Problems with Synchronized Visits and Stochastic Travel and Service Times: Applications in Healthcare. Transportation Science, 54(4), 1053-1072. Lien externe
Delaite, A., & Pesant, G. (juin 2017). Counting weighted spanning trees to solve constrained minimum spanning tree problems [Communication écrite]. 14th International Conference on Integration of AI and OR Techniques in Constraint Programming, Padua, Italy. Lien externe
Doulabi, S. H. H., Rousseau, L.-M., & Pesant, G. (2016). A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling. INFORMS Journal on Computing, 28(3), 432-448. Lien externe
Demassey, S., Pesant, G., & Rousseau, L.-M. (2006). A Cost-Regular Based Hybrid Column Generation Approach. Constraints, 11(4), 315-333. Lien externe
Demassey, S., Pesant, G., & Rousseau, L.-M. (mai 2005). Constraint programming based column generation for employee timetabling [Communication écrite]. 2nd International Conference (CPAIOR 2005), Prague, (CZ). Lien externe
El-Mahi, O., Pesant, G., Nicolescu, G., & Beltrame, G. (octobre 2013). Embedded system verification through constraint-based scheduling [Communication écrite]. International Symposium on Rapid System Prototyping (RSP 2013), Montréal, Québec, Canada. Lien externe
El-Mahi, O., Nicolescu, G., Pesant, G., & Beltrame, G. (novembre 2012). Embedded system verification through constraint-based scheduling [Communication écrite]. IEEE International High Level Design Validation and Test Workshop (HLDVT 2012), Huntington Beach, CA, USA. Lien externe
Frayret, J.-M., Meignan, D., & Pesant, G. (août 2012). Interactive planning system for forest road construction [Communication écrite]. 4th International Conference on Information Systems, Logistics and Supply Chain (ILS 2012), Québec, Canada. Lien externe
Gagnon, S., & Pesant, G. (juin 2018). Accelerating counting-based search [Communication écrite]. 15th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, Netherlands. Lien externe
Gaudreault, J., Pesant, G., Frayret, J.-M., & D'Amours, S. (2012). Supply chain coordination using an adaptive distributed search strategy. IEEE Transactions on Systems, Man and Cybernetics. Part C, Applications and Reviews, 42(6), 1424-1438. Lien externe
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
Gaudreault, J., Pesant, G., Frayret, J.-M., & D'Amours, S. (janvier 2009). An adaptive search strategy for efficient distributed decision making [Communication écrite]. Learning and Intelligent Optimization Conference, Trento, Italy. Non disponible
Gaudreault, J., Frayret, J.-M., & Pesant, G. (2009). Distributed search for supply chain coordination. Computers in Industry, 60(6), 441-451. Lien externe
Gaudreault, J., Pesant, G., Frayret, J.-M., & D'Amours, S. (2008). ADS: An adaptive search strategy for efficient distributed decision making. (Rapport technique n° CIRRELT-2008-49). Lien externe
Gaudreault, J., Frayret, J.-M., Pesant, G., Forget, P., & D'Amours, S. (septembre 2008). Operations coordination in the lumber industry: from heuristics sto machine learning [Communication écrite]. 13th Annual International Conference on Industrial Engineering Theory, Applications & Practice, Las Vegas, Nevada. Non disponible
Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (mai 2008). Using local search to speed up filtering algorithms for some NP-hard 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
Gaudreault, J., Frayret, J.-M., & Pesant, G. (2007). Concurrent Discrepancy-based Search for Distributed Optimization. (Rapport technique n° CIRRELT-2007-09). Lien externe
Gaudreault, J., Frayret, J.-M., & Pesant, G. (octobre 2007). Discrepancy-based method for hierarchical distributed optimization [Communication écrite]. 19th IEEE International Conference on Tools with Artificial Intelligence, Patras, Greece. Lien externe
Gaudreault, J., Frayret, J.-M., & Pesant, G. (septembre 2007). Discrepancy-based optimization for distributed supply chain operations planning [Communication écrite]. 9th International Workshop on Distributed Constraint Reasoning, Providence, Rhode Island. Lien externe
Gendron, B., Lebbah, H., & Pesant, G. (mai 2005). Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation [Communication écrite]. 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005), Prague, Czech Republic. Lien externe
Gendreau, M., Pesant, G., & Rousseau, L.-M. (2002). Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows. Journal of Heuristics, 8(1), 43-58. Lien externe
Galinier, P., Jaumard, B., Morales, R., & Pesant, G. (janvier 2001). Constraint-based approach to the Golomb ruler problem [Communication écrite]. 3rd International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2001), Ashford, UK. Non disponible
Hashemi Doulabi, H., Jaillet, P., Pesant, G., & Rousseau, L.-M. (2021). Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios. INFORMS Journal on Computing, 33(1), 143-162. Lien externe
Haouas, M. N., Aloise, D., & Pesant, G. (septembre 2020). An exact CP approach for the cardinality-constrained euclidean minimum sum-of-squares clustering problem [Communication écrite]. 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2020), Vienna, Austria. Disponible
Hashemi Doulabi, S. H., Rousseau, L.-M., & Pesant, G. (mai 2014). A constraint programming-based column generation approach for operating room planning and scheduling [Communication écrite]. 11th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2014), Cork, Ireland. Lien externe
Hellsten, L., Pesant, G., & Van Beek, P. A Domain Consistency Algorithm for the Stretch Constraint [Communication écrite]. 10th International Conference on Principles and Practice of Constraint Programming (CP 2004). Lien externe
Ibrahim, M. H., Pal, C. J., & Pesant, G. (2020). Leveraging cluster backbones for improving MAP inference in statistical relational models. Annals of Mathematics and Artificial Intelligence, 88(8), 907-949. Lien externe
Ibrahim, M.-H., Pal, C. J., & Pesant, G. (2017). Improving probabilistic inference in graphical models with determinism and cycles. Machine Learning, 106(1), 1-54. Lien externe
Ibrahim, M. H., Pal, C. J., & Pesant, G. (janvier 2015). Exploiting determinism to scale relational inference [Communication écrite]. 29th AAAI Conference on Artificial Intelligence (AAAI 2015) and 27th Innovative Applications of Artificial Intelligence Conference (IAAI 2015), Austin, TX, United states. Publié dans Proceedings of the ... AAAI Conference on Artificial Intelligence, 29(1). Lien externe
Lafleur, D., Anbil Parthipan, S. C., & Pesant, G. (juillet 2022). Combining reinforcement learning and constraint programming for sequence-generation tasks with hard constraints [Communication écrite]. 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), Haifa, Israel. Lien externe
Lodi, A., Olivier, P., Pesant, G., & Sankaranarayanan, S. (2022). Fairness over time in dynamic resource allocation with an application in healthcare. Mathematical Programming, 34 pages. 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
Le Bras, R., Zanarini, A., & Pesant, G. (septembre 2009). Efficient generic search heuristics within the embp framework [Communication écrite]. 15th International Conference on Principles and Practice of Constraint Programming (CP 2009), Lisbon, Portugal. Lien externe
Laporte, G., & Pesant, G. (2004). A General Multi-Shift Scheduling System. Journal of the Operational Research Society, 55(11), 1208-1217. Lien externe
Meignan, D., Frayret, J.-M., & Pesant, G. (2015). Interactive planning system for forest road location. Journal of Heuristics, 21(6), 789-817. Lien externe
Meignan, D., Knust, S., Frayret, J.-M., Pesant, G., & Gaud, N. (2015). A review and taxonomy of interactive optimization methods in operations research. Transactions on Interactive Intelligent Systems, 5(3), 1-43. Lien externe
Meignan, D., Frayret, J.-M., & Pesant, G. (2013). Interactive planning system for forest road location. (Rapport technique n° CIRRELT-2013-37). Lien externe
Meignan, D., Frayret, J.-M., Pesant, G., & Blouin, M. (2012). A heuristic approach to automated forest road location. Canadian Journal of Forest Research, 42(12), 2130-2141. 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
Meric, L., Pesant, G., & Pierre, S. (2004). Recherche locale à voisinage variable pour le routage optique dans des réseaux utilisant des routeurs latins. [Variable Neighbourhood Search for Optical Routing in Networks Using Latin Routers]. Annales des télécommunications, 59(3-4), 265-280. Lien externe
Nahon, R., Bilodeau, G.-A., & Pesant, G. (mai 2022). Improving tracking with a tracklet associator [Communication écrite]. 19th Conference on Robots and Vision (CRV 2022), Toronto, ON, Canada. Lien externe
Olivier, P., Lodi, A., & Pesant, G. (2021). Measures of balance in combinatorial optimization. 4OR, 20(3), 391-415. Lien externe
Olivier, P., Lodi, A., & Pesant, G. (2021). The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints. INFORMS Journal on Computing, 33(3), 949-962. Lien externe
Olivier, P., Lodi, A., & Pesant, G. (juin 2018). A comparison of optimization methods for multi-objective constrained bin packing problems [Communication écrite]. 15th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, Netherlands. Lien externe
Olivier, P., Lodi, A., & Pesant, G. (2017). A comparison of optimization methods for multi-objective constrained bin packing problems. (Rapport technique n° DS4DM-2017-015). Lien externe
Olivier, G., Lodi, A., & Pesant, G. (2017). A comparison of optimization methods for multi-objective contrained bin packing problems. (Rapport technique n° DS4DM-2017-015). Lien externe
Pesant, G. (août 2023). Mini CPBP : a constraint solver propagating beliefs [Résumé]. XCSP3 Competition 2023, France. Non disponible
Pezzoli, G., & Pesant, G. (mai 2023). A Weighted Counting Algorithm for the Circuit Constraint [Communication écrite]. 20th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023), Nice, France. Lien externe
Pesant, G., & Burlats, A. (septembre 2022). MiniCPBP : a constraint solver propagating beliefs [Communication écrite]. XCSP3 Competition 2022, France. 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
Pesant, G., Meel, K. S., & Mohammadalitajrishi, M. (juillet 2021). On the Usefulness of Linear Modular Arithmetic in Constraint Programming [Communication écrite]. 18th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2021), Vienna, Austria. Lien externe
Pesant, G. (janvier 2021). From support propagation to belief propagation in constraint programming (extended abstract) [Communication écrite]. 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), Yokohama, Japan. Lien externe
Pesant, G. (2019). From support propagation to belief propagation in constraint programming. Journal of Artificial Intelligence Research, 66, 123-150. Lien externe
Pineault, A., Bilodeau, G.-A., & Pesant, G. (septembre 2019). Tracking pedestrians using constraint programming [Communication écrite]. 25th International Conference on Principles and Practice of Constraint Programming (CP 2019), Stamford, CT, USA. Non disponible
Pesant, G. (février 2017). Getting more out of the exposed structure in constraint programming models of combinatorial problems [Communication écrite]. 31st Conference on Artificial Intelligence (AAAI 2017), San Francisco, California. Publié dans Proceedings of the ... AAAI Conference on Artificial Intelligence, 31(1). Lien externe
Pesant, G. (mai 2016). Balancing Nursing Workload by Constraint Programming [Communication écrite]. 13th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR 2016), Banff, AB, Canada. Lien externe
Pesant, G. (février 2016). Counting-based search for constraint optimization problems [Communication écrite]. 30th AAAI Conference on Artificial Intelligence, Phoenix, Arizona, USA. Publié dans Proceedings of the ... AAAI Conference on Artificial Intelligence, 30(1). Lien externe
Pesant, G. (2015). Achieving domain consistency and counting solutions for dispersion constraints. (Rapport technique n° CIRRELT-2015-08). Lien externe
Pesant, G. (2015). Achieving Domain Consistency and Counting Solutions for Dispersion Constraints. INFORMS Journal on Computing, 27(4), 690-703. Lien externe
Pesant, G. (août 2015). Achieving Domain Consistency and Counting Solutions for Dispersion Constraints [Résumé]. 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland. Lien externe
Pesant, G., Rix, G., & Rousseau, L.-M. (mai 2015). A comparative study of MIP and CP formulations for the B2B scheduling optimization problem [Communication écrite]. 12th International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR 2015), Barcelona, Spain. Lien externe
Pesant, G. (2014). A constraint programming primer. EURO Journal on Computational Optimization, 2(3), 89-97. Lien externe
Pesant, G. (août 2012). A constraint programming approach to the traveling tournament problem with predefined venues [Communication écrite]. 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), Son, Norway. 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
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
Pesant, G. (2010). Constraints: Editor's note. Constraints, 15(3), 305-306. Lien externe
Pesant, G., Quimper, C.-G., Rousseau, L.-M., & Sellmann, M. (mai 2009). The polytope of context-free grammar constraints [Communication écrite]. 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Pittsburgh, PA, USA. 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
Pomerleau, Y., Chamberland, S., & Pesant, G. (2006). On Solving the Tree-Topology Design Problem for Wireless Cellular Networks. Journal of Communications and Networks, 8(1), 85-92. Lien externe
Pesant, G., & Rousseau, L.-M. (2005). Programmation par contraintes. Dans Baptiste, P., Giard, V., Haït, A., & Soumis, F. (édit.), Gestion de production et ressources humaines : Méthodes de planification dans les systèmes productifs (p. 223-247). Lien externe
Pesant, G. (août 2005). Counting Solutions of CSPs : A structural approach [Communication écrite]. 19th International Joint Conference on Artificial Intelligence, Edinburgh (UK). Lien externe
Pesant, G., & Régin, J.-C. (octobre 2005). SPREAD : a balancing constraint based on statistics [Communication écrite]. 11th International Conference on Principles and Practice of Constraint Programming (CP 2005), Sitges, Spain. Lien externe
Pesant, G. (septembre 2004). A regular language membership constraint for finite sequences of variables [Communication écrite]. 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), Toronto, Ont., Canada. Lien externe
Pomerleau, Y., Chamberland, S., & Pesant, G. A Constraint Programming Approach for the Design Problem of Cellular Wireless Networks [Communication écrite]. Canadian Conference on Electrical and Computer Engineering (CCECE 2003). Lien externe
Pesant, G. (octobre 2003). Regular language membership constraint for sequences of variables [Communication écrite]. 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland. Non disponible
Pesant, G., & Laporte, G. (janvier 2002). Algorithme robuste pour la confection d'horaires cycliques [Communication écrite]. Journées francophones de programmation logique et programmation par contraintes (JFPLC 2002), Nice, France. Non disponible
Pesant, G., & Soriano, P. (2002). An optimal strategy for the constrained cycle cover problem. Annals of Mathematics and Artificial Intelligence, 34(4), 313-325. Lien externe
Pesant, G. (novembre 2001). A filtering algorithm for the stretch constraint, principles and practice of constraint programming [Communication écrite]. 7th International Conference on Principles and Practice of Constraint Programming (CP 2001), Paphos CYP. Lien externe
Pesant, G., & Gendreau, M. (1999). A constraint programming framework for local search methods. Journal of Heuristics, 5(3), 255-279. Lien externe
Pesant, G., Gendreau, M., Potvin, J.-Y., & Rousseau, J.-M. (1999). On the Flexibility of constraints programming models: from single to multiple time windows for the traveling salesman problem. European Journal of Operational Research, 117(2), 253-263. Lien externe
Pesant, G., & Boyer, M. (1999). Reasoning about solids using constraints logic programming. Journal of Automated Reasoning, 22(3), 241-262. Lien externe
Pesant, G., Gendreau, M., Potvin, J.-Y., & Rousseau, J.-M. (1998). Exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Science, 32(1), 12-29. Lien externe
Pesant, G., Gendreau, M., & Rousseau, J.-M. (janvier 1997). GENIUS-CP: a generic single-vehicle routing algorithm [Communication écrite]. 3rd International Conference on Principles and Practice of Constraint Programming (CP 1997), Linz. Lien externe
Pesant, G., Séguin, R., & Soriano, P. (août 1997). High school timetabling by constraint programming [Communication écrite]. 2nd international conference on the practice and theory of automated timetabling (PATAT 1997), Toronto, Canada. Non disponible
Pesant, G., & Gendreau, M. (août 1996). View of local search in constraint programming [Communication écrite]. 2nd International Conference on Principles and Practice of Constraint Programming (CP 1996), Cambridge, US. Lien externe
Rix, G., Rousseau, L.-M., & Pesant, G. (2014). A column generation algorithm for tactical timber transportation planning. Journal of the Operational Research Society, 66(2), 278-287. Lien externe
Rix, G., Rousseau, L.-M., & Pesant, G. (2014). A transportation-driven approach to annual harvest planning. (Rapport technique n° CIRRELT-2014-24). Lien externe
Rix, G., Rousseau, L.-M., & Pesant, G. (2013). A column generation algorithm for tactical timber transportation planning. (Rapport technique n° CIRRELT-2013-40). Lien externe
Rousseau, L.-M., Gendreau, M., & Pesant, G. (2013). The synchronized vehicle dispatching problem. INFOR, 51(2), 76-83. Lien externe
Rix, G., Pesant, G., & Rousseau, L.-M. (juin 2013). A tactical transportation-driven harvest planning problem [Communication écrite]. 8th Triennal Symposium on Transportation Analysis, San Pedro de Atacama, Chile. Lien externe
Rix, J. G., Pesant, G., & Rousseau, L.-M. (mai 2012). A column generation algorithm to solve a multi-period synchronized log-truck scheduling problem [Communication écrite]. 5th International Workshop on Freight Transportation and Logistics, Mikonos, Grèce. Non disponible
Rousseau, L.-M., Focacci, F., Gendreau, M., & Pesant, G. (2004). Solving VRPTW with Constraint Programming Based Column Generation. Annals of Operations Research, 130(1-4), 199-216. Lien externe
Rousseau, L.-M., Gendreau, M., & Pesant, G. (mai 2003). Synchronized vehicle dispatching problem [Communication écrite]. Odysseus 2003, Palermo, Italy (3 pages). Lien externe
Rousseau, L.-M., Pesant, G., & Gendreau, M. (2002). General approach to the physician rostering problem. Annals of Operations Research, 115(1-4), 193-205. Lien externe
Rousseau, L.-M., Gendreau, M., & Pesant, G. (janvier 2002). Solving small VRPTWs with constraint programming based column generation [Communication écrite]. International Symposium on Combinatorial Optimization, Paris, France. Non disponible
Rousseau, L.-M., Pesant, G., & Gendreau, M. (janvier 2001). Building negative reduced cost paths using constraint programming [Communication écrite]. 7th International Conference on Principles and Practice of Constraint Programming (CP 2001), Paphos. Lien externe
Rousseau, L.-M., Gendreau, M., & Pesant, G. (janvier 2000). A Hybrid Algorithm to Solve Physician Rostering Problem [Communication écrite]. 2nd Workshop on Integration of AI and OR Techniques in constraint Programming for Combinatorial Optimization Problems. Non disponible
Rousseau, L.-M., Gendreau, M., & Pesant, G. (janvier 1999). Hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules [Communication écrite]. Journées francophones de programmation logique et programmation par contraintes (JFPLC 1999), Lyon, France. Non disponible
Rousseau, L.-M., Gendreau, M., & Pesant, G. (juin 1999). Une hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules [Communication écrite]. 8es Journées francophones de programmation logique et programmation par contraintes (JFPLC 1999), Lyon, France. Non disponible
Rousseau, L.-M., Gendreau, M., & Pesant, G. (janvier 1999). Using constraint-based operators with Variable Neighborhood Search to solve the Vehicle Routing Problem with Time Windows [Communication écrite]. 1st Workshop on Integration of AI and OR Techniques in constraint Programming for Combinatorial Optimization Problems. Non disponible
Sakti, A., Pesant, G., & Guéhéneuc, Y.-G. (mai 2017). JTeXpert at the SBST 2017 Tool Competition [Communication écrite]. IEEE/ACM 10th International Workshop on Search-Based Software Testing (SBST 2017), Buenos Aires, Argentina. Lien externe
Sakti, A., Pesant, G., & Guéhéneuc, Y.-G. (mai 2016). JTExpert at the fourth unit testing tool competition [Communication écrite]. 9th International Workshop on Search-Based Software Testing (SBST 2016), Austin, TX, United states. Lien externe
Sakti, A., Pesant, G., & Guéhéneuc, Y.-G. (2015). Instance Generator and Problem Representation to Improve Object Oriented Code Coverage. IEEE Transactions on Software Engineering, 41(3), 294-313. Lien externe
Sakti, A., Pesant, G., & Guéhéneuc, Y.-G. (mai 2015). JTExpert at the Third Unit Testing Tool Competition [Communication écrite]. 8th International Workshop on Search-Based Software Testing (SBST 2015), Florence, Italy. Lien externe
Sakti, A., Guéhéneuc, Y.-G., & Pesant, G. (mai 2013). Constraint-based fitness function for search-based software testing [Communication écrite]. 10th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2013), Berlin, Germany. Lien externe
Sakti, A., Guéhéneuc, Y.-G., & Pesant, G. (septembre 2012). Boosting search based testing by using constraint based testing [Communication écrite]. 4th International Symposium on Search Based Software Engineering (SSBSE 2012), Riva del Garda, Italy. Lien externe
Soumis, F., Pesant, G., & Rousseau, L.-M. (2005). Gestion des horaires et affectation du personnel. Dans Baptiste, P., Giard, V., Haït, A., & Soumis, F. (édit.), Gestion de production et ressources humaines : Méthodes de planification dans les systèmes productifs (p. 71-111). Lien externe
Verhaeghe, H., Cappart, Q., Pesant, G., & Quimper, C.-G. (septembre 2024). Learning Precedences for Scheduling Problems with Graph Neural Networks [Communication écrite]. 30th International Conference on Principles and Practice of Constraint Programming (CP 2024), Girona, Spain (18 pages). 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. (2020). Learning optimal decision trees using constraint programming. Constraints, 25(3-4), 226-250. Lien externe
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
van Hoeve, W.-J., Pesant, G., Rousseau, L.-M., & Sabharwal, A. (2009). New filtering algorithms for combinations of among constraints. Constraints, 14(2), 273-292. Lien externe
Van Hoeve, W.-J., Pesant, G., & Rousseau, L.-M. (2006). On global warming: Flow-based soft global constraints. Journal of Heuristics, 12(4-5), 347-373. Lien externe
Van Hoeve, W. J., Pesant, G., Rousseau, L.-M., & Sabharwal, A. Revisiting the Sequence Constraint [Communication écrite]. 12th International Conference on Principles and Practice of Constraint Programming (CP 2006). Lien externe
van Hoeve, W. J., Pesant, G., & Rousseau, L.-M. On global warming (softening global constraints) [Communication écrite]. Workshop on Preferences and Soft Constraints. Lien externe
Yin, C., Cappart, Q., & Pesant, G. (mai 2024). An Improved Neuro-Symbolic Architecture to Fine-Tune Generative AI Systems [Communication écrite]. 21st International Conference on Integration of Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR 2024), Uppsala, Sweden. Lien externe
Zanarini, A., & Pesant, G. (juin 2010). More Robust counting-based Search Heuristics with Alldifferent Constraints [Communication écrite]. 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010), Bologna, Italie. Lien externe
Zanarini, A., & Pesant, G. (2009). Solution counting algorithms for constraint-centered search heuristics. Constraints, 14(3), 392-413. Lien externe
Zanarini, A., & Pesant, G. (2007). Solution counting algorithms for constraint-centered search heuristics. (Document de travail n° CIRRELT-2007-18). Lien externe
Zanarini, A., & Pesant, G. (mai 2007). Generalizations of the global cardinality constraint for hierarchical resources [Communication écrite]. 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2007), Brussels, Belgium. Lien externe
Zanarini, A., & Pesant, G. (septembre 2007). Solution counting algorithms for constraint-centered search heuristics [Communication écrite]. 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), Providence, RI, United States. Lien externe
Zanarini, A., Milano, M., & Pesant, G. (mai 2006). Improved algorithm for the soft global cardinality constraint [Communication écrite]. 3rd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2006), Cork, Ireland. Lien externe
