| 2024 | |
| H. Verhaeghe, Q. Cappart, G. Pesant, C.-G. Quimper (2024). Learning Precedences for Scheduling Problems with Graph Neural Networks. 30th International Conference on Principles and Practice of Constraint Programming (CP 2024), v. LIPIcs 307, p. 30:1-30:18. | (.pdf) |
| Y. Aalian, M. Gamache, G. Pesant (2024). Short-term underground mine planning with uncertain activity durations using constraint programming. J. Scheduling ??, p. ??-??. DOI: 10.1007/s10951-024-00808-x | (.pdf) |
| A. Lodi, P. Olivier, G. Pesant, S. Sankaranarayanan (2024). Fairness over time in dynamic resource allocation with an application in healthcare. Mathematical Programming 203, p. 285-318. DOI: 10.1007/s10107-022-01904-6 | (.pdf) |
| F. Camelin, S. Loudni, G. Pesant, C. Truchet (2024). Échantillonnage d'ensemble de motifs diversifiés par compression locale. Extraction et Gestion des Connaissances, RNTI-E-40, p. 83-94. | (.pdf) |
| C. Yin, Q. Cappart, G. Pesant (2024). An Improved Neuro-Symbolic Architecture to Fine-Tune Generative AI Systems. 21th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2024), v. 14743, p. 279-288. | (.pdf) |
| M. Azema, G. Desaulniers, J. Mendoza, G. Pesant (2024). A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints. 21th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2024), v. 14743, p. 17-33. | (.pdf) |
| 2023 | |
| Y. Aalian, G. Pesant, M. Gamache (2023). Optimization of Short-Term Underground Mine Planning Using Constraint Programming. 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), v. LIPIcs 280, p. 6:1-6:16. | (.pdf) |
| A. Burlats, G. Pesant (2023). Exploiting Entropy in Constraint Programming. 20th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2023), v. 13884, p. 320-335. | (.pdf) |
| G. Pezzoli, G. Pesant (2023). A Weighted Counting Algorithm for the Circuit Constraint. 20th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2023), v. 13884, p. 370-377. | (.pdf) |
| 2022 | |
| M. Bofill, J. Coll, M. Garcia, J. Giráldez-Cru, G. Pesant, J. Suy, M. Villaret (2022). Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem. Journal of Artificial Intelligence Research 74, p. 263-301. DOI: 10.1613/jair.1.12670 | (.pdf) |
| D. Lafleur, S. Chandar, G. Pesant (2022). Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints. 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), v. LIPIcs 235, p. 30:1-30:16. | (.pdf) |
| G. Pesant, C.-G. Quimper, H. Verhaeghe (2022). Practically Uniform Solution Sampling in Constraint Programming. 19th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2022), v. 13292, p. 335-344. | (.pdf) (résumé en français JFPC) |
| R. Nahon, G.-A. Bilodeau, G. Pesant (2022). Improving tracking with a tracklet associator. 19th Conference on Robots and Vision (CRV 2022), p. 175-182. DOI: 10.1109/CRV55824.2022.00030 | (.pdf) |
| 2021 | |
| G. Pesant, K.S. Meel, M. Mohammadalitajrishi (2021). On the Usefulness of Linear Modular Arithmetic in Constraint Programming. 18th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2021), v. 12735, p. 248-265. | (.pdf) (.mp4) |
| G. Farnadi, W. St-Arnaud, B. Babaki, M. Carvalho (2021). Individual Fairness in Kidney Exchange Programs. 35th Conference on Artificial Intelligence (AAAI 2021). | (.pdf) |
| P. Olivier, A. Lodi, G. Pesant (2021). Measures of balance in combinatorial optimization. 4OR-Q J Oper Res. DOI: 10.1007/s10288-021-00486-x | (.pdf) |
| P. Olivier, A. Lodi, G. Pesant (2021). The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints. INFORMS Journal on Computing, 33, p. 949-962. DOI: 10.1287/ijoc.2020.0983 | (.pdf) |
| S. H. Hashemi Doulabi, P. Jaillet, G. Pesant, L.-M. Rousseau (2021). Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios. INFORMS Journal on Computing, 33, p. 143-162. DOI: 10.1287/ijoc.2019.0928 | (.pdf) #health |
| 2020 | |
| H. Verhaeghe, S. Nijssen, G. Pesant, C.-G. Quimper, P. Schaus (2020). Learning Optimal Decision Trees using Constraint Programming . Constraints, 25, p. 226-250. DOI: 10.1007/s10601-020-09312-3 | |
| B. Babaki, G. Pesant (2020). Parallel Planning using a Lazy Clause Generator Solver. 32nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2020). | (.pdf) (.mp4) |
| M. H. Ibrahim, C. J. Pal, G. Pesant (2020). Leveraging Cluster Backbones for Improving MAP Inference in Statistical Relational Models. Annals of Mathematics and Artificial Intelligence, 88(8), p. 907-949. DOI: 10.1007/s10472-020-09698-z | (.pdf) |
| S. H. Hashemi Doulabi, G. Pesant, L.-M. Rousseau (2020). Vehicle Routing Problems with Synchronized Visits and Stochastic Travel and Service Times: Applications in Healthcare. Transportation Science, 54(4), p. 1053-1072. DOI: 10.1287/trsc.2019.0956 | #health |
| H. Verhaeghe, S. Nijssen, G. Pesant, C.-G. Quimper, P. Schaus (2020). Learning Optimal Decision Trees using Constraint Programming (Extended Abstract). 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), p. 4765-4769. | (.pdf) |
| G. Pesant (2020). From Support Propagation to Belief Propagation in Constraint Programming (Extended Abstract). 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), p. 5100-5104. | (.pdf) (.mp4) (poster) #CBS |
| B. Babaki, B. Omrani, G. Pesant (2020). Combinatorial Search in CP-Based Iterated Belief Propagation. 26th International Conference on Principles and Practice of Constraint Programming (CP 2020), v. 12333, p. 21-36. | (.pdf) (.mp4) #CBS |
| B. Babaki, G. Pesant, C.-G. Quimper (2020). Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search. 13th International Symposium on Combinatorial Search (SoCS 2020), p. 2-10. | (.pdf) (.mp4) #CBS |
| M. N. Haouas, D. Aloise, G. Pesant (2020). An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem. 17th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2020), v. 12296, p. 256-272. | (.pdf) (.mp4) |
| 2019 | |
| G. Lo Bianco, X. Lorca, C. Truchet, G. Pesant (2019). Revisiting Counting Solutions for the Global Cardinality Constraint. Journal of Artificial Intelligence Research 66, p. 411-441. DOI: 10.1613/jair.1.11325 | (.pdf) #CBS |
| G. Pesant (2019). From Support Propagation to Belief Propagation in Constraint Programming. Journal of Artificial Intelligence Research 66, p. 123-150. DOI: 10.1613/jair.1.11487 | (.pdf) #CBS |
| H. Verhaeghe, S. Nijssen, G. Pesant, C.-G. Quimper, P. Schaus (2019). Learning Optimal Decision Trees using Constraint Programming. 25th International Conference on Principles and Practice of Constraint Programming (CP 2019). | (.pdf) |
| P. Coste, A. Lodi, G. Pesant (2019). Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems. 16th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2019), v. 11494 LNCS, p. 182-191. | (.pdf) #CBS |
| G. Pesant (2019). A Commentary on “A regular language membership constraint for finite sequences of variables”. CP Anniversary Volume. | (.pdf) |
| 2018 | |
| S. Gagnon, G. Pesant (2018). Accelerating Counting-Based Search. 15th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2018), v. 10848 LNCS, p. 245-253. | (.pdf) #CBS |
| P. Olivier, A. Lodi, G. Pesant (2018). A Comparison of Optimization Methods for Multi-Objective Constrained Bin Packing Problems. 15th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2018), v. 10848 LNCS, p. 462-476. | (.pdf) |
| 2017 | |
| A. Delaite, G. Pesant (2017). Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems. 14th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2017), v. 10335 LNCS, p. 176-184. DOI: 10.1007/978-3-319-59776-8_14 | (.pdf) #CBS |
| G. Pesant (2017). Getting More Out of the Exposed Structure in Constraint Programming Models of Combinatorial Problems. 31th Conference on Artificial Intelligence (AAAI 2017), p. 4846-4850. Blue Sky Award | (.pdf) #CBS |
| M. H. Ibrahim, C. J. Pal, G. Pesant (2017). Improving Probabilistic Inference in Graphical Models with Determinism and Cycles. Machine Learning, 106(1), p. 1-54. DOI : 10.1007/s10994-016-5585-5 | (.pdf) |
| 2016 | |
| S. H. Hashemi Doulabi, L.-M. Rousseau, G. Pesant (2016). A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling. INFORMS Journal on Computing, 28(3), p. 432-448. | #health #hybrid |
| G. Pesant (2016). Balancing Nursing Workload by Constraint Programming. 13th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2016), v. 9676 LNCS, p. 294-302. DOI: 10.1007/978-3-319-33954-2_21 | (.pdf) #health #rostering |
| G. Pesant (2016). Counting-Based Search for Constraint Optimization Problems. 30th Conference on Artificial Intelligence (AAAI 2016), p. 3441-3448. | (.pdf) #CBS |
| 2015 | |
| G. Pesant, G. Rix, L.-M. Rousseau (2015). A comparative study of MIP and CP formulations for the B2B scheduling optimization problem. 12th International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR 2015), v. 9075, p. 306-321. DOI : 10.1007/978-3-319-18008-3_21 |
(.pdf) #hybrid |
| A. Sakti, G. Pesant, Y.-G. Gueheneuc (2015). Instance Generator and Problem Representation to Improve Object Oriented Code Coverage. IEEE Transactions on Software Engineering, 41(3), p. 294-313. DOI : 10.1109/TSE.2014.2363479 | (.pdf) #verif |
| G. Rix, L.-M. Rousseau, G. Pesant (2015). A column generation algorithm for tactical timber transportation planning. Journal of the Operational Research Society, 66(2), p. 278-287. DOI : 10.1057/jors.2013.170 | (.pdf) #forestry |
| D. Meignan, J.-M. Frayret, G. Pesant (2015). Interactive planning system for forest road location. J. Heuristics, 21(6), p. 789-817. | #forestry |
| G. Pesant (2015). Achieving Domain Consistency and Counting Solutions for Dispersion Constraints. INFORMS Journal on Computing, 27(4), p. 690-703. | (.pdf) #filtering #CBS |
| D. Meignan, S. Knust, J.-M. Frayret, G. Pesant, N. Gaud (2015). A Review and Taxonomy of Interactive Optimization Methods in Operations Research. TiiS, 5(3), p. 17:1-17:43. | |
| M. H. Ibrahim, C. J. Pal, G. Pesant (2015). Exploiting Determinism to Scale Relational Inference. 29th Conference on Artificial Intelligence (AAAI 2015), p. 1756-1762. | (.pdf) |
| A. Sakti, G. Pesant, Y.-G. Guéhéneuc (2015). JTExpert at the Third Unit Testing Tool Competition. SBST@ICSE 2015, p. 52-55. | #verif |
| 2014 | |
| G. Pesant (2014). A constraint programming primer. EURO Journal on Computational Optimization, 2(3), p. 89-97. DOI : 10.1007/s13675-014-0026-3 | (.pdf) |
| S. H. Hashemi Doulabi, L.-M. Rousseau, G. Pesant (2014). A constraint programming-based column generation approach for operating room planning and scheduling. 11th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2014), v. 8451 LNCS, p. 455-463. DOI : 10.1007/978-3-319-07046-9_32 | #health #hybrid |
| 2013 | |
| S. Brockbank, G. Pesant, L.-M. Rousseau (2013). Counting spanning trees to guide search in constrained spanning tree problems. 19th International Conference on Principles and Practice of Constraint Programming (CP 2013), v. 8124 LNCS, p. 175-183. | (.pdf) #CBS |
| O. El-Mahi, G. Pesant, G. Nicolescu, G. Beltrame (2013). Embedded system verification through constraint-based scheduling. 2013 International Symposium on Rapid System Prototyping (RSP), p. 73-79. | #verif |
| L.-M. Rousseau, M. Gendreau, G. Pesant (2013). The synchronized vehicle dispatching problem. INFOR, 51(2), p. 76-83. | |
| A. Sakti, Y.-G. Guéhéneuc, G. Pesant (2013). Constraint-based fitness function for search-based software testing. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 10th International Conference (CPAIOR 2013), p. 378-385. | (.pdf) #verif |
| 2012 | |
| G. Berbeglia, G. Pesant, L.-M. Rousseau (2012). Feasibility of the pickup and delivery problem with fixed partial routes: A complexity analysis. Transportation Science, 46(3), p. 359-373. | |
| O. El-Mahi, G. Nicolescu, G. Pesant, G. Beltrame (2012). Embedded system verification through constraint-based scheduling. High Level Design Validation and Test Workshop (HLDVT) 2012 IEEE International, p. 92-95. | #verif |
| J.-M. Frayret, D. Meignan, G. Pesant (2012). Interactive planning system for forest road construction. 4th International Conference on Information Systems, Logistics and Supply Chain. | #forestry |
| J. Gaudreault, G. Pesant, J.-M. Frayret, S. D'Amours (2012). Supply chain coordination using an adaptive distributed search strategy. IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, 42(6), p. 1424-1438. | #distrib |
| D. Meignan, J.-M. Frayret, G. Pesant, M. Blouin (2012). A heuristic approach to automated forest road location. Canadian Journal of Forest Research, 42(12), p. 2130-2141. | #forestry |
| G. Pesant, C.-G. Quimper, A. Zanarini (2012). Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems. Journal of Artificial Intelligence Research, 43, p. 173-210. | (.pdf) #CBS |
| G. Rix, G. Pesant, L.-M. Rousseau (2012). A column generation algorithm to solve a multi-period synchronized log-truck scheduling problem. 5th International Workshop on Freight Transportation and Logistics. | #forestry |
| A. Sakti, Y.-G. Guéhéneuc, G. Pesant (2012). Boosting search based testing by using constraint based testing. 4th International Symposium on Search Based Software Engineering (SSBSE 2012), v. 7515 LNCS, p. 213-227. | (.pdf) #verif |
| G. Pesant (2012). A Constraint Programming Approach to the Traveling Tournament Problem with Predefined Venues. 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), p. 303-315. | (.pdf) |
| 2011 | |
| A. Sakti, Y.-G. Guéhéneuc, G. Pesant (2011). CP-SST : approche basée surla programmation par contraintes pour le test structurel du logiciel. 7e Journées francophones de programmation par contraintes (JFPC 2011), p. 289-298. | (.pdf) #verif |
| G. Berbeglia, G. Pesant, L.-M. Rousseau (2011). Checking the feasibility of dial-a-ride instances using constraint programming. Transportation Science, 45(3), p. 399-412. | |
| N. Bhattacharya, A. Sakti, G. Antoniol, Y.-G. Guéhéneuc, G. Pesant (2011). Divide-by-zero exception raising via branch coverage. 3rd International Symposium on Search-Based Software Engineering (SSBSE 2011), v. 6956 LNCS, p. 204-218. | (.pdf) #verif |
| N. Bhattacharya, A. Sakti, G. Antoniol, Y.-G. Guéhéneuc, G.Pesant (2011). Performance analysis of metaheuristic and constraint programming approaches. 4th International conference on Software Testing, Verification and Validation. | (.pdf) #verif |
| P. Galinier, A. Hertz, S. Paroz, G. Pesant (2011). Using local search to speed up filtering algorithms for some NP-hard constraints. Annals of Operations Research, 184, p. 121-135. | (.pdf) #filtering |
| A. Lodi, G. Pesant, L.-M. Rousseau (2011). On counting lattice points and chvatal-gomory cutting planes. 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011), v. 6697 LNCS, p. 131-136. DOI : 10.1007/978-3-642-21311-3_13 | (.pdf) #hybrid |
| D. Meignan, J.-M. Frayret, G. Pesant (2011). An interactive heuristic approach for the P-forest problem. IEEE International Conference on Systems, Man, and Cybernetics (SMC 2011), p. 1009-1013. | #forestry |
| G. Pesant, A. Zanarini (2011). Recovering indirect solution densities for counting-based branching heuristics. 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011), v. 6697 LNCS, p. 170-175. | (.pdf) #CBS |
| 2010 | |
| A. Zanarini, G. Pesant (2010). More Robust Counting-based Search Heuristics with Alldifferent Constraints. 7th International Conference Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010), v. 6140 LNCS, p. 354-368. | (.pdf) #CBS |
| 2009 | |
| J. Gaudreault, J.-M. Frayret, G. Pesant (2009). Distributed search for supply chain coordination. Computers in Industry, 60(6), p. 441-451. | #distrib |
| J. Gaudreault, G. Pesant, J.-M. Frayret, S. D'amours (2009). An adaptive search strategy for efficient distributed decision making. Learning and Intelligent Optimization Conference. | #distrib |
| R. Le Bras, A. Zanarini, G. Pesant (2009). Efficient generic search heuristics within the EMBP framework. 15th International Conference on Principles and Practice of Constraint Programming (CP 2009), v. 5732 LNCS, p. 539-553. | (.pdf) #CBS |
| G. Pesant, C.-G. Quimper, L.-M. Rousseau, M. Sellmann (2009). The polytope of context-free grammar constraints. 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2009), p. 223-232. | (.pdf) #hybrid |
| W.-J. van Hoeve, G. Pesant, L.-M. Rousseau, A. Sabharwal (2009). New filtering algorithms for combinations of among constraints. Constraints, 14(2), p. 273-292. | (.pdf) #filtering |
| A. Zanarini, G. Pesant (2009). Solution counting algorithms for constraint-centered search heuristics. Constraints, 14(3), p. 392-413. | (.pdf) #CBS |
| 2008 | |
| P. Galinier, Al.Hertz, S. Paroz, Gi.Pesant (2008). Using local search to speed up filtering algorithms for some NP-hard constraints. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), v. 5015 LNCS, p. 298-302. | (.pdf) #filtering |
| J. Gaudreault, J.-M. Frayret, G. Pesant, P. Forget, S. D'Amours (2008). Operations coordination in the lumber industry: from heuristics to machine learning. 13th Annual International Conference on Industrial Engineering Theory, Applications & Practice. | #forestry #distrib |
| G. Pesant, C.-G. Quimper (2008). Counting solutions of knapsack constraints. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), v. 5015 LNCS, p. 203-217. | (.pdf) #CBS |
| G. Pesant (2008). Constraint-Based Rostering. 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2008). | (.pdf) #rostering |
| 2007 | |
| J. Gaudreault, J.-M. Frayret, G. Pesant (2007). Discrepancy-based method for hierarchical distributed optimization. 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), v. 2, p. 75-81. | #distrib |
| J. Gaudreault, J.-M. Frayret, G. Pesant (2007). Discrepancy-based optimization for distributed supply chain operations planning. Ninth International Workshop on Distributed Constraint Reasoning. | #distrib |
| A. Zanarini, G. Pesant (2007). Solution counting algorithms for constraint-centered search heuristics. 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), v. 4741 LNCS, p. 743-757. Best Paper Award | (.pdf) #CBS |
| A. Zanarini, G. Pesant (2007). Generalizations of the global cardinality constraint for hierarchical resources. Proceedings of the 4th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2007), v. 4510 LNCS, p. 361-375. | (.pdf) #filtering |
| 2006 | |
| S. Demassey, G. Pesant, L. M. Rousseau (2006). A Cost-Regular Based Hybrid Column Generation Approach. Constraints, 11(4), p. 315-333. | (.pdf) #hybrid #filtering |
| Y. Pomerleau, S. Chamberland, G. Pesant (2006). On Solving the Tree-Topology Design Problem for Wireless Cellular Networks. Journal of communication and networks, 8(1), p. 85-92. | |
| W. J. Van Hoeve, G. Pesant, L. M. Rousseau, A. Sabharwal (2006). Revisiting the Sequence Constraint. Principles and Practice of Constraint Programming (CP 2006), v. 4204 LNCS, p. 620-634. Best Paper Award | (.pdf) #filtering |
| W. J. Van Hoeve, G. Pesant, L.-M. Rousseau (2006). On global warming: Flow-based soft global constraints. Journal of Heuristics, 12(4-5), p. 347-373. | (.pdf) #filtering |
| A. Zanarini, M. Milano, G. Pesant (2006). Improved algorithm for the soft global cardinality constraint. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Third International Conference (CPAIOR 2006), v. 3990 LNCS, p. 288-299. | (.pdf) #filtering |
| A. Zanarini, G. Pesant, M. Milano (2006). Planning with Soft Regular Constraints. ICAPS Workshop on Preferences and Soft Constraints in Planning, p. 73-78. | (.pdf) #planning |
| C.-G. Quimper, A. López-Ortiz, G. Pesant (2006). A Quadratic Propagator for the Inter-Distance Constraint. 20th Conference on Artificial Intelligence (AAAI 2006), pp. 123-128. | (.pdf) #filtering |
| M. Gendreau, J. A. Ferland, B. Gendron, N. Hail, B. Jaumard, S. D. Lapierre, G. Pesant, P. Soriano: (2006). Physician Scheduling in Emergency Rooms. International Conference on the Practice and Theory of Automated Timetabling (PATAT 2006), p. 53-66. | (.pdf) #health #rostering |
| 2005 | |
| M. Andre, G. Pesant, S. Pierre (2005). A variable neighborhood search algorithm for assigning cells to switches in wireless networks. Journal of computer sciences, 1(2), p. 175-181. | |
| S. Demassey, G. Pesant, L.-M. Rousseau (2005). Constraint programming based column generation for employee timetabling. Proceedings of the 2nd International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005), v. 3524 LNCS, p. 217-227. | (.pdf) #hybrid #filtering #rostering |
| B. Gendron, H. Lebbah, G. Pesant (2005). Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation. Proceedings of the 2nd International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005), v. 3524 LNCS, p. 217-227. | #hybrid |
| G. Pesant (2005). Counting Solutions of CSPs : A structural approach. Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), p. 260-265. | (.pdf) #CBS |
| G. Pesant, J.-C. Régin (2005). SPREAD : a balancing constraint based on statistics. 11th International Conference on Principles and practice of constraint programming (CP 2005), v. 3709 LNCS, p. 460-474. | (.pdf) #filtering |
| G. Pesant, L.-M. Rousseau (2005). Programmation par contraintes. Gestion de production et ressources humaines : Méthodes de planification dans les systèmes productifs. Montréal: Presses Polytechnique. p. 223-247. | |
| F. Soumis, G. Pesant, L.-M. Rousseau (2005). Gestion des horaires et affectations du personnel. Gestion de production et ressources humaines : Méthodes de planification dans les systèmes productifs. Montréal: Pressses Polytechnique. p. 71-111. | |
| 2004 | |
| L. Hellsten, G. Pesant, P. Van Beek (2004). A Domain Consistency Algorithm for the Stretch Constraint. 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), v. 3258 LNCS, p. 290-304. | #filtering |
| G. Laporte, G. Pesant (2004). A General Multi-Shift Scheduling System. Journal of the Operational Research Society, 55(11), p. 1208-1217. | (.pdf) #rostering |
| L. Meric, G. Pesant, S. Pierre (2004). Variable Neighbourhood Search for Optical Routing in Networks Using Latin Routers. Annales des télécommunications, 59(3-4), p. 265-280. | |
| G. Pesant (2004). A regular language membership constraint for finite sequences of variables. 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), v. 3258 LNCS, p. 482-495. | (.pdf) #filtering |
| L.-M. Rousseau, F. Focacci, M. Gendreau, G. Pesant (2004). Solving VRPTW with Constraint Programming Based Column Generation. Annals of Operations Research, 130, p. 199-216. | #hybrid |
| W. J. van Hoeve, G. Pesant, L.-M. Rousseau (2004). On Global Warming (Softening Global Constraints). Workshop on Preferences and Soft Constraints. | (.pdf) #filtering |
| 2003 | |
| G. Amoussou, M. Andre, G. Pesant, S. Pierre (2003). A constraint programming approach to assign cells to switches in personal communication networks. Annales des télécommunications, 58(3-4), p. 584-604. | |
| S. Bourdais, P. Galinier, G. Pesant (2003). HIBISCUS: a constraint programming application to staff scheduling in health care. Proceedings of the ninth international conference on Principles and practice of constraint programming, (CP 2003), v. 2833 LNCS, p. 153-167. | (.pdf) #health #rostering |
| G. Pesant (2003). Regular language membership constraint for sequences of variables. Principles and practice of constraint programming : proceedings of the ninth international conference (CP 2003), v. 2833 LNCS, p. 110-119. | |
| Y. Pomerleau, S. Chamberland, G. Pesant (2003). A Constraint Programming Approach for the Design Problem of Cellular Wireless Networks. CCECE 2003: Canadian Conference on Electrical and Computer Engineering, Vols 1-3, Proceedings - Toward a Caring and Humane Technology, p. 881-884. | |
| L. M. Rousseau, M. Gendreau, G. Pesant (2003). Synchronized vehicle dispatching problem. Proc. Odysseus 2003. | |
| 2002 | |
| G. Amoussou, M. André, G. Pesant, S. Pierre (2002). Affectation de cellules à des commutateurs dans les réseaux cellulaires mobiles par programmation par contraintes. 2002 canadian conference on electrical and computer engineering (CCECE'02), v. 3, p. 1311-1316. | |
| M. André, G. Pesant, S. Pierre (2002). Using tabu search for assigning cells to switches in mobile cellular networks. 21st biennal symposium on communications, p. 129-133. | |
| J.-M. Bourjolly, G. Laporte, G. Pesant (2002). An exact algorithm for the maximum k-club problem in an undirected graph. European journal of operational research, 138(1), p. 21-28. | |
| M. Gendreau, G. Pesant, L.-M. Rousseau (2002). Using constraint-based operators to solve the vehicle routing problem with time windows. Journal of heuristics, 8, p. 43-58. | #hybrid |
| G. Pesant, G. Laporte (2002). Algorithme robuste pour la confection d'horaires cycliques. Journées francophones de programmation logique et programmation par contraintes (JFPLC'02). | #rostering |
| G. Pesant, P. Soriano (2002). An optimal strategy for the constrained cycle cover problem. Annals of mathematics and artificial intelligence, 34(4), p. 313-325. | |
| L.-M. Rousseau, M. Gendreau, G. Pesant (2002). Solving small VRPTWs with constraint programming based column generation. International symposium on combinatorial optimization. | #hybrid |
| L.-M. Rousseau, G. Pesant, M. Gendreau (2002). General approach to the physician rostering problem. Annals of Operations Research, 115, p. 193-205. | #health #rostering |
| 2001 | |
| G. Amoussou, G. Pesant, S. Pierre (2001). Affectation de cellules à des commutateurs par programmation par contraintes. Proceedings 2001 Canadian Conference on Electrical and Computer Engineering, v. 2, p. 1017-1022. | |
| P. Galinier, B. Jaumard, R. Morales, G. Pesant (2001). Constraint-based approach to the Golomb ruler problem. 3rd international workshop on the intergration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR 2001). | |
| G. Pesant (2001). A filtering algorithm for the stretch constraint. Proceedings of the Seventh International Conference on principles and practice of constraint programming (CP 2001), v. 2239 LNCS, p. 183-195. | (.pdf) #filtering |
| L.-M. Rousseau, G. Pesant, M. Gendreau (2001). Building negative reduced cost paths using constraint programming. Principles and practice of constraint programming: 7th international conference (CP 2001), v. 2239, p. 778. | #hybrid |
| 2000 | |
| J. M. Bourjolly, G. Laporte, Gilles Pesant (2000). Heuristics for Finding k-Clubs in an Undirected Graph. Computers & Operations Research, 27(6), p. 559-569. | |
| L.-M. Rousseau, M. Gendreau, G. Pesant (2000). A Hybrid Algorithm to Solve Physician Rostering Problem. Second Workshop on Integration of AI and OR Techniques in constraint Programming for Combinatorial Optimization Problems (CPAIOR 2000). | #hybrid #health #rostering |
| 1999 | |
| G. Pesant, M. Boyer (1999). Reasoning about solids using constraints logic programming. Journal of automated reasoning, 22, p. 241-262. | |
| G. Pesant, M. Gendreau (1999). Constraint programming framework for local search methods. Journal of heuristics, 5, p. 255-279. | #hybrid |
| G. Pesant, M. Gendreau, J.-Y. Potvin, J.-M. Rousseau (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, p. 253-263. | |
| L.-M. Rousseau, M. Gendreau, G. Pesant (1999). Hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules. Journées francophones de programmation logique et programmation par contraintes (JFPLC 1999), p. 145-160. | #hybrid |
| L.-M. Rousseau, M. Gendreau, G. Pesant (1999). Using constraint-based operators with Variable Neighborhood Search to solve the Vehicle Routing Problem with Time Windows. First Workshop on Integration of AI and OR Techniques in constraint Programming for Combinatorial Optimization Problems (CPAIOR 1999). | #hybrid |
| 1998 | |
| G. Pesant, M. Gendreau, J.-Y. Potvin, L.-M. Rousseau (1998). Exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation science, 32, p. 12-29. | |
| 1997 | |
| G. Pesant, M. Gendreau, J.-M. Rousseau (1997). GENIUS-CP: a generic single-vehicle routing algorithm. principles and practice of constraints programming, 3rd international conference (CP 1997), v. 1330 LNCS, p. 420-434. | |
| G. Pesant, R. Séguin, P. Soriano (1997). High school timetabling by constraint programming. 2nd international conference on the practice and theory of automated timetabling (PATAT'97), p. 340-344. | |
| 1996 | |
| G. Pesant, M. Gendreau (1996). A view of local search in constraint programming. Principles and practice of constraint programming, 2nd international conference (CP 1996), v. 1118 LNCS, p. 353-366. | #hybrid |
| 1994 | |
| G. Pesant, M. Boyer (1994). QUAD-CLP(R): Adding the Power of Quadratic Constraints. Principles and practice of constraint programming, 2nd International Workshop (PPCP 1994), v. 874 LNCS, p. 95-108. | |
| 1993 | |
| G. Pesant, M. Boyer (1993). Handling Quadratic Constraints through Geometry. International Symposium on Logic Programming (ILPS 1993), v. 1118 LNCS, p. 659. | |
