 | Up a level |
Azéma, M., Desaulniers, G., Mendoza, J. E., & Pesant, G. (2024, May). A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints [Paper]. 21st International Conference on Integration of Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR 2024), Uppsala, Sweden. External link
Aalian, Y., Gamache, M., & Pesant, G. (2024). Short-term underground mine planning with uncertain activity durations using constraint programming. Journal of Scheduling, 17 pages. External link
Aalian, Y., Pesant, G., & Gamache, M. (2023, August). Optimization of Short-Term Underground Mine Planning Using Constraint Programming [Paper]. 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), Toronto, ON, Canada (16 pages). External link
Abdelilah, S., Guéhéneuc, Y.-G., & Pesant, G. (2011, June). CP-SST : approche basée sur la programmation par contraintes pour le test structurel du logiciel [Paper]. 7es Journées francophones de programmation par contraintes, Lyon, France. Unavailable
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. Available
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. External link
Amoussou, G., André, M., Pesant, G., & Pierre, S. (2002, May). Affectation de cellules à des commutateurs dans les réseaux cellulaires mobiles par programmation par contraintes [Paper]. Canadian Conference on Electrical and Computer Engineering (CCECE 2002), Winnipeg, Manitoba. Unavailable
André, M., Pesant, G., & Pierre, S. (2002, May). 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]. [Paper]. Journées de l'optimisation/Optimization Days 2002, Montréal, Québec. Unavailable
André, M., Pesant, G., & Pierre, S. (2002, January). Using tabu search for assigning cells to switches in mobile cellular networks [Paper]. 21st Biennal Symposium on Communications, Kingston. Unavailable
Amoussou, G., Pesant, G., & Pierre, S. (2001, May). Affectation de cellules à des commutateurs par programmation par contraintes [Paper]. Canadian Conference on Electrical and Computer Engineering (CCECE 2001), Toronto, Ont., Canada. External link
André, M., Amoussou, G., Pierre, S., & Pesant, G. (2001, May). An exact constraint programming algorithm for the assignment of cells to switches in a mobile communication network [Presentation]. In 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. Unavailable
Burlats, A., & Pesant, G. (2023, May). Exploiting Entropy in Constraint Programming [Paper]. 20th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023), Nice, France. External link
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. External link
Babaki, B., Omrani, B., & Pesant, G. (2020, September). Combinatorial Search in CP-Based Iterated Belief Propagation [Paper]. 26th International Conference on Principles and Practice of Constraint Programming, Louvain-la-Neuve, Belgium. External link
Babaki, B., & Pesant, G. (2020, November). Parallel Planning using a Lazy Clause Generation Solver [Paper]. 32nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2020). External link
Babaki, B., Pesant, G., & Quimper, C.-G. (2020, May). Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search [Paper]. 13th International Symposium on Combinatorial Search (SOCS 2020), Vienna, Austria. Published in Proceedings of the International Symposium on Combinatorial Search, 11(1). External link
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. External link
Brockbank, S., Pesant, G., & Rousseau, L.-M. (2013, September). Counting spanning trees to guide search in constrained spanning tree problems [Paper]. 19th International Conference on Principles and Practice of Constraint Programming (CP 2013), Uppsala, Sweden. External link
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. External link
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. External link
Bhattacharya, N., Sakti, A., Antoniol, G., Guéhéneuc, Y.-G., & Pesant, G. (2011, September). Divide-by-zero exception raising via branch coverage [Paper]. 3rd International Symposium on Search Based Software Engineering (SSBSE 2011), Szeged, Hungary. External link
Bhattacharya, N., Sakti, A., Antoniol, G., Guéhéneuc, Y.-G., & Pesant, G. (2011, March). Performance analysis of metaheuristic and constraint programming approaches [Paper]. 4th International conference on Software Testing, Verification and Validation, Berlin, Germany. Unavailable
Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2010). Checking the Feasibility of Dial-a-Ride Instances using Constraint Programming. (Technical Report n° CIRRELT-2010-16). External link
Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2010). Feasibility of the pickup and delivery problem with fixed partial routes: A complexity Analysis. (Technical Report n° CIRRELT-2010-15). External link
Boivin, S., Gendron, B., & Pesant, G. (2008). A load balancing procedure for parallel constraint programming. (Technical Report n° CIRRELT-2008-32). External link
Bourdais, S., Galinier, P., & Pesant, G. (2003, September). HIBISCUS: a constraint programming application to staff scheduling in health care [Paper]. 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland. External link
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. External link
Bourjolly, J. M., Laporte, G., & Pesant, G. (2000). Heuristics for Finding k-Clubs in an Undirected Graph. Computers & Operations Research, 27(6), 559-569. External link
Coste, P., Lodi, A., & Pesant, G. (2019, June). Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems [Paper]. 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2019), Thessaloniki, Greece. External link
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. External link
Delaite, A., & Pesant, G. (2017, June). Counting weighted spanning trees to solve constrained minimum spanning tree problems [Paper]. 14th International Conference on Integration of AI and OR Techniques in Constraint Programming, Padua, Italy. External link
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. External link
Demassey, S., Pesant, G., & Rousseau, L.-M. (2006). A Cost-Regular Based Hybrid Column Generation Approach. Constraints, 11(4), 315-333. External link
Demassey, S., Pesant, G., & Rousseau, L.-M. (2005, May). Constraint programming based column generation for employee timetabling [Paper]. 2nd International Conference (CPAIOR 2005), Prague, (CZ). External link
El-Mahi, O., Pesant, G., Nicolescu, G., & Beltrame, G. (2013, October). Embedded system verification through constraint-based scheduling [Paper]. International Symposium on Rapid System Prototyping (RSP 2013), Montréal, Québec, Canada. External link
El-Mahi, O., Nicolescu, G., Pesant, G., & Beltrame, G. (2012, November). Embedded system verification through constraint-based scheduling [Paper]. IEEE International High Level Design Validation and Test Workshop (HLDVT 2012), Huntington Beach, CA, USA. External link
Frayret, J.-M., Meignan, D., & Pesant, G. (2012, August). Interactive planning system for forest road construction [Paper]. 4th International Conference on Information Systems, Logistics and Supply Chain (ILS 2012), Québec, Canada. External link
Gagnon, S., & Pesant, G. (2018, June). Accelerating counting-based search [Paper]. 15th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, Netherlands. External link
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. External link
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. External link
Gaudreault, J., Pesant, G., Frayret, J.-M., & D'Amours, S. (2009, January). An adaptive search strategy for efficient distributed decision making [Paper]. Learning and Intelligent Optimization Conference, Trento, Italy. Unavailable
Gaudreault, J., Frayret, J.-M., & Pesant, G. (2009). Distributed search for supply chain coordination. Computers in Industry, 60(6), 441-451. External link
Gaudreault, J., Pesant, G., Frayret, J.-M., & D'Amours, S. (2008). ADS: An adaptive search strategy for efficient distributed decision making. (Technical Report n° CIRRELT-2008-49). External link
Gaudreault, J., Frayret, J.-M., Pesant, G., Forget, P., & D'Amours, S. (2008, September). Operations coordination in the lumber industry: from heuristics sto machine learning [Paper]. 13th Annual International Conference on Industrial Engineering Theory, Applications & Practice, Las Vegas, Nevada. Unavailable
Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2008, May). Using local search to speed up filtering algorithms for some NP-hard constraints [Paper]. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), Paris, France. External link
Gaudreault, J., Frayret, J.-M., & Pesant, G. (2007). Concurrent Discrepancy-based Search for Distributed Optimization. (Technical Report n° CIRRELT-2007-09). External link
Gaudreault, J., Frayret, J.-M., & Pesant, G. (2007, October). Discrepancy-based method for hierarchical distributed optimization [Paper]. 19th IEEE International Conference on Tools with Artificial Intelligence, Patras, Greece. External link
Gaudreault, J., Frayret, J.-M., & Pesant, G. (2007, September). Discrepancy-based optimization for distributed supply chain operations planning [Paper]. 9th International Workshop on Distributed Constraint Reasoning, Providence, Rhode Island. External link
Gendron, B., Lebbah, H., & Pesant, G. (2005, May). Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation [Paper]. 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005), Prague, Czech Republic. External link
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. External link
Galinier, P., Jaumard, B., Morales, R., & Pesant, G. (2001, January). Constraint-based approach to the Golomb ruler problem [Paper]. 3rd International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2001), Ashford, UK. Unavailable
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. External link
Haouas, M. N., Aloise, D., & Pesant, G. (2020, September). An exact CP approach for the cardinality-constrained euclidean minimum sum-of-squares clustering problem [Paper]. 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2020), Vienna, Austria. Available
Hashemi Doulabi, S. H., Rousseau, L.-M., & Pesant, G. (2014, May). A constraint programming-based column generation approach for operating room planning and scheduling [Paper]. 11th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2014), Cork, Ireland. External link
Hellsten, L., Pesant, G., & Van Beek, P. A Domain Consistency Algorithm for the Stretch Constraint [Paper]. 10th International Conference on Principles and Practice of Constraint Programming (CP 2004). External link
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. External link
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. External link
Ibrahim, M. H., Pal, C. J., & Pesant, G. (2015, January). Exploiting determinism to scale relational inference [Paper]. 29th AAAI Conference on Artificial Intelligence (AAAI 2015) and 27th Innovative Applications of Artificial Intelligence Conference (IAAI 2015), Austin, TX, United states. Published in Proceedings of the ... AAAI Conference on Artificial Intelligence, 29(1). External link
Lafleur, D., Anbil Parthipan, S. C., & Pesant, G. (2022, July). Combining reinforcement learning and constraint programming for sequence-generation tasks with hard constraints [Paper]. 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), Haifa, Israel. External link
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. External link
Lodi, A., Pesant, G., & Rousseau, L.-M. (2011, May). On counting lattice points and chvatal-gomory cutting planes [Paper]. 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011), Berlin, Germany. External link
Le Bras, R., Zanarini, A., & Pesant, G. (2009, September). Efficient generic search heuristics within the embp framework [Paper]. 15th International Conference on Principles and Practice of Constraint Programming (CP 2009), Lisbon, Portugal. External link
Laporte, G., & Pesant, G. (2004). A General Multi-Shift Scheduling System. Journal of the Operational Research Society, 55(11), 1208-1217. External link
Meignan, D., Frayret, J.-M., & Pesant, G. (2015). Interactive planning system for forest road location. Journal of Heuristics, 21(6), 789-817. External link
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. External link
Meignan, D., Frayret, J.-M., & Pesant, G. (2013). Interactive planning system for forest road location. (Technical Report n° CIRRELT-2013-37). External link
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. External link
Meignan, D., Frayret, J.-M., & Pesant, G. (2011, October). An interactive heuristic approach for the P-forest problem [Paper]. IEEE International Conference on Systems, Man, and Cybernetics (SMC 2011), Anchorage, AK, United states. External link
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. External link
Nahon, R., Bilodeau, G.-A., & Pesant, G. (2022, May). Improving tracking with a tracklet associator [Paper]. 19th Conference on Robots and Vision (CRV 2022), Toronto, ON, Canada. External link
Olivier, P., Lodi, A., & Pesant, G. (2021). Measures of balance in combinatorial optimization. 4OR, 20(3), 391-415. External link
Olivier, P., Lodi, A., & Pesant, G. (2021). The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints. INFORMS Journal on Computing, 33(3), 949-962. External link
Olivier, P., Lodi, A., & Pesant, G. (2018, June). A comparison of optimization methods for multi-objective constrained bin packing problems [Paper]. 15th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, Netherlands. External link
Olivier, P., Lodi, A., & Pesant, G. (2017). A comparison of optimization methods for multi-objective constrained bin packing problems. (Technical Report n° DS4DM-2017-015). External link
Olivier, G., Lodi, A., & Pesant, G. (2017). A comparison of optimization methods for multi-objective contrained bin packing problems. (Technical Report n° DS4DM-2017-015). External link
Pesant, G. (2023, August). Mini CPBP : a constraint solver propagating beliefs [Abstract]. XCSP3 Competition 2023, France. Unavailable
Pezzoli, G., & Pesant, G. (2023, May). A Weighted Counting Algorithm for the Circuit Constraint [Paper]. 20th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023), Nice, France. External link
Pesant, G., & Burlats, A. (2022, September). MiniCPBP : a constraint solver propagating beliefs [Paper]. XCSP3 Competition 2022, France. External link
Pesant, G., Quimper, C.-G., & Verhaeghe, H. (2022, June). Practically uniform solution sampling in constraint programming [Paper]. 19th International Conference on Integration of Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR 2022), Los Angeles, CA, USA. External link
Pesant, G., Meel, K. S., & Mohammadalitajrishi, M. (2021, July). On the Usefulness of Linear Modular Arithmetic in Constraint Programming [Paper]. 18th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2021), Vienna, Austra. External link
Pesant, G. (2021, January). From support propagation to belief propagation in constraint programming (extended abstract) [Paper]. 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), Yokohama, Japan. External link
Pesant, G. (2019). From support propagation to belief propagation in constraint programming. Journal of Artificial Intelligence Research, 66, 123-150. External link
Pineault, A., Bilodeau, G.-A., & Pesant, G. (2019, September). Tracking pedestrians using constraint programming [Paper]. 25th International Conference on Principles and Practice of Constraint Programming (CP 2019), Stamford, CT, USA. Unavailable
Pesant, G. (2017, February). Getting more out of the exposed structure in constraint programming models of combinatorial problems [Paper]. 31st Conference on Artificial Intelligence (AAAI 2017), San Francisco, California. Published in Proceedings of the ... AAAI Conference on Artificial Intelligence, 31(1). External link
Pesant, G. (2016, May). Balancing Nursing Workload by Constraint Programming [Paper]. 13th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR 2016), Banff, AB, Canada. External link
Pesant, G. (2016, February). Counting-based search for constraint optimization problems [Paper]. 30th AAAI Conference on Artificial Intelligence, Phoenix, Arizona, USA. Published in Proceedings of the ... AAAI Conference on Artificial Intelligence, 30(1). External link
Pesant, G. (2015). Achieving domain consistency and counting solutions for dispersion constraints. (Technical Report n° CIRRELT-2015-08). External link
Pesant, G. (2015). Achieving Domain Consistency and Counting Solutions for Dispersion Constraints. INFORMS Journal on Computing, 27(4), 690-703. External link
Pesant, G. (2015, August). Achieving Domain Consistency and Counting Solutions for Dispersion Constraints [Abstract]. 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland. External link
Pesant, G., Rix, G., & Rousseau, L.-M. (2015, May). A comparative study of MIP and CP formulations for the B2B scheduling optimization problem [Paper]. 12th International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR 2015), Barcelona, Spain. External link
Pesant, G. (2014). A constraint programming primer. EURO Journal on Computational Optimization, 2(3), 89-97. External link
Pesant, G. (2012, August). A constraint programming approach to the traveling tournament problem with predefined venues [Paper]. 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), Son, Norway. External link
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. External link
Pesant, G., & Zanarini, A. (2011, May). Recovering indirect solution densities for counting-based branching heuristics [Paper]. 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011), Berlin, Germany. External link
Pesant, G. (2010). Constraints: Editor's note. Constraints, 15(3), 305-306. External link
Pesant, G., Quimper, C.-G., Rousseau, L.-M., & Sellmann, M. (2009, May). The polytope of context-free grammar constraints [Paper]. 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Pittsburgh, PA, USA. External link
Pesant, G., & Quimper, C.-G. (2008, May). Counting solutions of knapsack constraints [Paper]. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), Paris, France. External link
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. External link
Pesant, G., & Rousseau, L.-M. (2005). Programmation par contraintes. In Baptiste, P., Giard, V., Haït, A., & Soumis, F. (eds.), Gestion de production et ressources humaines : Méthodes de planification dans les systèmes productifs (pp. 223-247). External link
Pesant, G. (2005, August). Counting Solutions of CSPs : A structural approach [Paper]. 19th International Joint Conference on Artificial Intelligence, Edinburgh (UK). External link
Pesant, G., & Régin, J.-C. (2005, October). SPREAD : a balancing constraint based on statistics [Paper]. 11th International Conference on Principles and Practice of Constraint Programming (CP 2005), Sitges, Spain. External link
Pesant, G. (2004, September). A regular language membership constraint for finite sequences of variables [Paper]. 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), Toronto, Ont., Canada. External link
Pomerleau, Y., Chamberland, S., & Pesant, G. A Constraint Programming Approach for the Design Problem of Cellular Wireless Networks [Paper]. Canadian Conference on Electrical and Computer Engineering (CCECE 2003). External link
Pesant, G. (2003, October). Regular language membership constraint for sequences of variables [Paper]. 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland. Unavailable
Pesant, G., & Laporte, G. (2002, January). Algorithme robuste pour la confection d'horaires cycliques [Paper]. Journées francophones de programmation logique et programmation par contraintes (JFPLC 2002), Nice, France. Unavailable
Pesant, G., & Soriano, P. (2002). An optimal strategy for the constrained cycle cover problem. Annals of Mathematics and Artificial Intelligence, 34(4), 313-325. External link
Pesant, G. (2001, November). A filtering algorithm for the stretch constraint, principles and practice of constraint programming [Paper]. 7th International Conference on Principles and Practice of Constraint Programming (CP 2001), Paphos CYP. External link
Pesant, G., & Gendreau, M. (1999). A constraint programming framework for local search methods. Journal of Heuristics, 5(3), 255-279. External link
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. External link
Pesant, G., & Boyer, M. (1999). Reasoning about solids using constraints logic programming. Journal of Automated Reasoning, 22(3), 241-262. External link
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. External link
Pesant, G., Gendreau, M., & Rousseau, J.-M. (1997, January). GENIUS-CP: a generic single-vehicle routing algorithm [Paper]. 3rd International Conference on Principles and Practice of Constraint Programming (CP 1997), Linz. External link
Pesant, G., Séguin, R., & Soriano, P. (1997, August). High school timetabling by constraint programming [Paper]. 2nd international conference on the practice and theory of automated timetabling (PATAT 1997), Toronto, Canada. Unavailable
Pesant, G., & Gendreau, M. (1996, August). View of local search in constraint programming [Paper]. 2nd International Conference on Principles and Practice of Constraint Programming (CP 1996), Cambridge, US. External link
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. External link
Rix, G., Rousseau, L.-M., & Pesant, G. (2014). A transportation-driven approach to annual harvest planning. (Technical Report n° CIRRELT-2014-24). External link
Rix, G., Rousseau, L.-M., & Pesant, G. (2013). A column generation algorithm for tactical timber transportation planning. (Technical Report n° CIRRELT-2013-40). External link
Rousseau, L.-M., Gendreau, M., & Pesant, G. (2013). The synchronized vehicle dispatching problem. INFOR, 51(2), 76-83. External link
Rix, G., Pesant, G., & Rousseau, L.-M. (2013, June). A tactical transportation-driven harvest planning problem [Paper]. 8th Triennal Symposium on Transportation Analysis, San Pedro de Atacama, Chile. External link
Rix, J. G., Pesant, G., & Rousseau, L.-M. (2012, May). A column generation algorithm to solve a multi-period synchronized log-truck scheduling problem [Paper]. 5th International Workshop on Freight Transportation and Logistics, Mikonos, Grèce. Unavailable
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. External link
Rousseau, L.-M., Gendreau, M., & Pesant, G. (2003, May). Synchronized vehicle dispatching problem [Paper]. Odysseus 2003, Palermo, Italy (3 pages). External link
Rousseau, L.-M., Pesant, G., & Gendreau, M. (2002). General approach to the physician rostering problem. Annals of Operations Research, 115(1-4), 193-205. External link
Rousseau, L.-M., Gendreau, M., & Pesant, G. (2002, January). Solving small VRPTWs with constraint programming based column generation [Paper]. International Symposium on Combinatorial Optimization, Paris, France. Unavailable
Rousseau, L.-M., Pesant, G., & Gendreau, M. (2001, January). Building negative reduced cost paths using constraint programming [Paper]. 7th International Conference on Principles and Practice of Constraint Programming (CP 2001), Paphos. External link
Rousseau, L.-M., Gendreau, M., & Pesant, G. (2000, January). A Hybrid Algorithm to Solve Physician Rostering Problem [Paper]. 2nd Workshop on Integration of AI and OR Techniques in constraint Programming for Combinatorial Optimization Problems. Unavailable
Rousseau, L.-M., Gendreau, M., & Pesant, G. (1999, January). Hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules [Paper]. Journées francophones de programmation logique et programmation par contraintes (JFPLC 1999), Lyon, France. Unavailable
Rousseau, L.-M., Gendreau, M., & Pesant, G. (1999, June). Une hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules [Paper]. 8es Journées francophones de programmation logique et programmation par contraintes (JFPLC 1999), Lyon, France. Unavailable
Rousseau, L.-M., Gendreau, M., & Pesant, G. (1999, January). Using constraint-based operators with Variable Neighborhood Search to solve the Vehicle Routing Problem with Time Windows [Paper]. 1st Workshop on Integration of AI and OR Techniques in constraint Programming for Combinatorial Optimization Problems. Unavailable
Sakti, A., Pesant, G., & Guéhéneuc, Y.-G. (2017, May). JTeXpert at the SBST 2017 Tool Competition [Paper]. IEEE/ACM 10th International Workshop on Search-Based Software Testing (SBST 2017), Buenos Aires, Argentina. External link
Sakti, A., Pesant, G., & Guéhéneuc, Y.-G. (2016, May). JTExpert at the fourth unit testing tool competition [Paper]. 9th International Workshop on Search-Based Software Testing (SBST 2016), Austin, TX, United states. External link
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. External link
Sakti, A., Pesant, G., & Guéhéneuc, Y.-G. (2015, May). JTExpert at the Third Unit Testing Tool Competition [Paper]. 8th International Workshop on Search-Based Software Testing (SBST 2015), Florence, Italy. External link
Sakti, A., Guéhéneuc, Y.-G., & Pesant, G. (2013, May). Constraint-based fitness function for search-based software testing [Paper]. 10th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2013), Berlin, Germany. External link
Sakti, A., Guéhéneuc, Y.-G., & Pesant, G. (2012, September). Boosting search based testing by using constraint based testing [Paper]. 4th International Symposium on Search Based Software Engineering (SSBSE 2012), Riva del Garda, Italy. External link
Soumis, F., Pesant, G., & Rousseau, L.-M. (2005). Gestion des horaires et affectation du personnel. In Baptiste, P., Giard, V., Haït, A., & Soumis, F. (eds.), Gestion de production et ressources humaines : Méthodes de planification dans les systèmes productifs (pp. 71-111). External link
Verhaeghe, H. , Nijssen, S., Pesant, G., Quimper, C.-G., & Schaus, P. (2021, June). Learning Optimal Decision Trees using Constraint Programming [Paper]. 16th French-Speaking Conference on Constraint Programming (JFPC 2021). Unavailable
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. External link
Verhaeghe, H., Nijssen, S., Pesant, G., Quimper, C.-G., & Schaus, P. (2021, January). Learning optimal decision trees using constraint programming (extended abstract) [Paper]. 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), Yokohama, Japan. External link
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. External link
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. External link
Van Hoeve, W. J., Pesant, G., Rousseau, L.-M., & Sabharwal, A. Revisiting the Sequence Constraint [Paper]. 12th International Conference on Principles and Practice of Constraint Programming (CP 2006). External link
van Hoeve, W. J., Pesant, G., & Rousseau, L.-M. On global warming (softening global constraints) [Paper]. Workshop on Preferences and Soft Constraints. External link
Yin, C., Cappart, Q., & Pesant, G. (2024, May). An Improved Neuro-Symbolic Architecture to Fine-Tune Generative AI Systems [Paper]. 21st International Conference on Integration of Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR 2024), Uppsala, Sweden. External link
Zanarini, A., & Pesant, G. (2010, June). More Robust counting-based Search Heuristics with Alldifferent Constraints [Paper]. 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010), Bologna, Italie. External link
Zanarini, A., & Pesant, G. (2009). Solution counting algorithms for constraint-centered search heuristics. Constraints, 14(3), 392-413. External link
Zanarini, A., & Pesant, G. (2007). Solution counting algorithms for constraint-centered search heuristics. (Working Paper n° CIRRELT-2007-18). External link
Zanarini, A., & Pesant, G. (2007, May). Generalizations of the global cardinality constraint for hierarchical resources [Paper]. 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2007), Brussels, Belgium. External link
Zanarini, A., & Pesant, G. (2007, September). Solution counting algorithms for constraint-centered search heuristics [Paper]. 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), Providence, RI, United States. External link
Zanarini, A., Milano, M., & Pesant, G. (2006, May). Improved algorithm for the soft global cardinality constraint [Paper]. 3rd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2006), Cork, Ireland. External link
