Publications by type

Gilles Pesant (109)

• Journal articles (38)
  • 2019
    • Journal article

      Pesant, G. (2019). From support propagation to belief propagation in constraint programming. Journal of Artificial Intelligence Research, 66, 123-150. Retrieved from https://doi.org/10.1613/jair.1.11487
    • Journal article

      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. Retrieved from https://doi.org/10.1613/jair.1.11325
  • 2017
    • Journal article

      Ibrahim, M.-H., Pal, C. & Pesant, G. (2017). Improving probabilistic inference in graphical models with determinism and cycles. Machine Learning, 106(1), 54 pages. Retrieved from https://doi.org/10.1007/s10994-016-5585-5
  • 2016
    • Journal article

      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. Retrieved from https://doi.org/10.1287/ijoc.2015.0686
  • 2015
    • Journal article

      Pesant, G. (2015). Achieving Domain Consistency and Counting Solutions for Dispersion Constraints. INFORMS Journal on Computing, 27(4), 690-703. Retrieved from https://doi.org/10.1287/ijoc.2015.0654
    • Journal article

      David, M., Sigrid, K., Frayret, J.-M., Gilles, P. & Nicolas, G. (2015). A review and taxonomy of interactive optimization methods in operations research. Transactions on Interactive Intelligent Systems, 5(3). Retrieved from https://doi.org/10.1145/2808234
    • Journal article

      Sakti, A., Pesant, G. & Gueheneuc, Y.G. (2015). Instance Generator and Problem Representation to Improve Object Oriented Code Coverage. IEEE Transactions on Software Engineering, 41(3), 294-313. Retrieved from https://doi.org/10.1109/TSE.2014.2363479
    • Journal article

      Meignan, D., Frayret, J.M. & Pesant, G. (2015). Interactive planning system for forest road location. Journal of Heuristics, 21(6), 789-817. Retrieved from https://doi.org/10.1007/s10732-015-9299-9
  • 2014
    • Journal article

      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. Retrieved from https://doi.org/10.1057/jors.2013.170
    • Journal article

      Pesant, G. (2014). A constraint programming primer. EURO Journal on Computational Optimization, 2(3), 89-97. Retrieved from https://doi.org/10.1007/s13675-014-0026-3
  • 2013
    • Journal article

      Rousseau, L.-M., Gendreau, M. & Pesant, G. (2013). The synchronized vehicle dispatching problem. INFOR, 51(2), 76-83. Retrieved from https://doi.org/10.3138/infor.51.2.76
  • 2012
    • Journal article

      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. Retrieved from https://doi.org/10.1139/x2012-140
    • Journal article

      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. Retrieved from https://doi.org/10.1613/jair.3463
    • Journal article

      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. Retrieved from https://doi.org/10.1287/trsc.1110.0394
    • Journal article

      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. Retrieved from https://doi.org/10.1109/TSMCC.2012.2188627
  • 2011
    • Journal article

      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. Retrieved from https://doi.org/10.1287/trsc.1100.0336
    • Journal article

      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, 121-135. Retrieved from https://doi.org/10.1007/s10479-010-0715-0
  • 2010
    • Journal article

      Pesant, G. (2010). Constraints: Editor's note. Constraints, 15(3), 305-306. Retrieved from https://doi.org/10.1007/s10601-010-9091-2
  • 2009
    • Journal article

      Gaudreault, J., Frayret, J.-M. & Pesant, G. (2009). Distributed search for supply chain coordination. Computers in Industry, 60(6), 441-451. Retrieved from https://doi.org/10.1016/j.compind.2009.02.006
    • Journal article

      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. Retrieved from https://doi.org/10.1007/s10601-008-9067-7
    • Journal article

      Zanarini, A. & Pesant, G. (2009). Solution counting algorithms for constraint-centered search heuristics. Constraints, 14(3), 392-413. Retrieved from https://doi.org/10.1007/s10601-008-9065-9
  • 2006
    • Journal article

      Demassey, S., Pesant, G. & Rousseau, L.M. (2006). A Cost-Regular Based Hybrid Column Generation Approach. Constraints, 11(4), 315-333. Retrieved from https://doi.org/10.1007/s10601-006-9003-7
    • Journal article

      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. Retrieved from https://doi.org/10.1007/s10732-006-6550-4
    • Journal article

      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. Retrieved from https://doi.org/10.1109/JCN.2006.6182908
  • 2005
    • Journal article

      Andre, 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. Retrieved from https://doi.org/10.3844/jcssp.2005.175.181
  • 2004
    • Journal article

      Laporte, G. & Pesant, G. (2004). A General Multi-Shift Scheduling System. Journal of the Operational Research Society, 55(11), 1208-1217. Retrieved from https://doi.org/10.1057/palgrave.jors.2601789
    • Journal article

      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. Retrieved from https://doi.org/10.1007/BF03179698
    • Journal article

      Rousseau, L.-M., Focacci, F., Gendreau, M. & G., P. (2004). Solving VRPTW with Constraint Programming Based Column Generation. Annals of Operations Research, 130, 199-216. Retrieved from https://doi.org/10.1023/B:ANOR.0000032576.73681.29
  • 2003
    • Journal article

      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. Retrieved from https://doi.org/10.1007/BF03001030
  • 2002
    • Journal article

      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. Retrieved from https://doi.org/10.1016/S0377-2217(01)00133-3
    • Journal article

      Pesant, G. & Soriano, P. (2002). An optimal strategy for the constrained cycle cover problem. Annals of Mathematics and Artificial Intelligence, 34(4), 313-325. Retrieved from https://doi.org/10.1023/A:1014444525059
    • Journal article

      Rousseau, L.-M., Pesant, G. & Gendreau, M. (2002). General approach to the physician rostering problem. Annals of Operations Research, 115(1-4), 193-205. Retrieved from https://doi.org/10.1023/A:1021153305410
    • Journal article

      Gendreau, M., Pesant, G. & Rousseau, L.-M. (2002). Using constraint-based operators to solve the vehicle routing plroblem with time windows. Journal of Heuristics, 8, 43-58. Retrieved from https://doi.org/10.1023/A:1013661617536
  • 2000
    • Journal article

      Bourjolly, J.M., Laporte, G. & Pesant, G. (2000). Heuristics for Finding k-Clubs in an Undirected Graph. Computers & Operations Research, 27(6), 559-569. Retrieved from https://doi.org/10.1016/S0305-0548(99)00047-7
  • 1999
    • Journal article

      Pesant, G. & Gendreau, M. (1999). A constraint programming framework for local search methods. Journal of Heuristics, 5(3), 255-279. Retrieved from https://doi.org/10.1023/A:1009694016861
    • Journal article

      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, 253-263. Retrieved from https://doi.org/10.1016/S0377-2217(98)00248-3
    • Journal article

      Pesant, G. & Boyer, M. (1999). Reasoning about solids using constraints logic programming. Journal of Automated Reasoning, 22(3), 241-262. Retrieved from https://doi.org/10.1023/A:1006080931326
  • 1998
    • Journal article

      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, 12-29. Retrieved from https://doi.org/10.1287/trsc.32.1.12
• Conference papers (67)
  • 2019
    • Conference paper

      Coste, P., Lodi, A. & Pesant, G. (2019). Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems. Paper presented at the 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2019), Thessaloniki, Greece (pp. 182-191). Retrieved from https://doi.org/10.1007/978-3-030-19212-9_12
  • 2018
    • Conference paper

      Gagnon, S. & Pesant, G. (2018). Accelerating counting-based search. Paper presented at the 15th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, Netherlands (pp. 245-253). Retrieved from https://doi.org/10.1007/978-3-319-93031-2_17
    • Conference paper

      Olivier, P., Lodi, A. & Pesant, G. (2018). A comparison of optimization methods for multi-objective constrained bin packing problems. Paper presented at the 15th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, Netherlands (pp. 462-476). Retrieved from https://doi.org/10.1007/978-3-319-93031-2_33
  • 2017
    • Conference paper

      Delaite, A. & Pesant, G. (2017). Counting weighted spanning trees to solve constrained minimum spanning tree problems. Paper presented at the 14th International Conference on Integration of AI and OR Techniques in Constraint Programming, Padua, Italy (pp. 176-184). Retrieved from https://doi.org/10.1007/978-3-319-59776-8_14
    • Conference paper

      Pesant, G. (2017). Getting more out of the exposed structure in constraint programming models of combinatorial problems. Paper presented at the 31st Conference on Artificial Intelligence (AAAI 2017), San Francisco, California (pp. 4846-4850).
    • Conference paper

      Sakti, A., Pesant, G. & Gueheneuc, Y.G. (2017). JTeXpert at the SBST 2017 Tool Competition. Paper presented at the IEEE/ACM 10th International Workshop on Search-Based Software Testing (SBST 2017), Buenos Aires, Argentina (pp. 43-46). Retrieved from https://doi.org/10.1109/SBST.2017.5
  • 2016
    • Conference paper

      Pesant, G. (2016). Balancing Nursing Workload by Constraint Programming. Paper presented at the 13th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR 2016), Banff, AB, Canada (pp. 294-302). Retrieved from https://doi.org/10.1007/978-3-319-33954-2_21
    • Conference paper

      Pesant, G. (2016). Counting-based search for constraint optimization problems. Paper presented at the 30th AAAI Conference on Artificial Intelligence, Phoenix, Arizona, USA (pp. 3441-3448). Retrieved from http://www.aaai.org/ocs/index.php/AAAI/AAAI16/paper/view/12065
    • Conference paper

      Sakti, A., Pesant, G. & Gueheneuc, Y.-G. (2016). JTExpert at the fourth unit testing tool competition. Paper presented at the 9th International Workshop on Search-Based Software Testing (SBST 2016), Austin, TX, United states (pp. 37-40). Retrieved from https://doi.org/10.1145/2897010.2897021
  • 2015
    • Conference paper

      Pesant, G. (2015). Achieving Domain Consistency and Counting Solutions for Dispersion Constraints [Abstract]. Presented at the 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland (pp. 740-740). Retrieved from https://doi.org/10.1007/978-3-319-23219-5
    • Conference paper

      Pesant, G., Rix, G. & Rousseau, L.-M. (2015). A comparative study of MIP and CP formulations for the B2B scheduling optimization problem. Paper presented at the 12th International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR 2015), Barcelona, Spain (pp. 306-321). Retrieved from https://doi.org/10.1007/978-3-319-18008-3_21
    • Conference paper

      Ibrahim, M.H., Pal, C.J. & Pesant, G. (2015). Exploiting determinism to scale relational inference. Paper presented at the 29th AAAI Conference on Artificial Intelligence (AAAI 2015) and 27th Innovative Applications of Artificial Intelligence Conference (IAAI 2015), Austin, TX, United states (pp. 1756-1762). Retrieved from http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9800
    • Conference paper

      Sakti, A., Pesant, G. & Gueheneuc, Y.-G. (2015). JTExpert at the Third Unit Testing Tool Competition. Paper presented at the 8th International Workshop on Search-Based Software Testing (SBST 2015), Florence, Italy (pp. 52-55). Retrieved from https://doi.org/10.1109/SBST.2015.20
  • 2014
    • Conference paper

      Hashemi Doulabi, S.H., Rousseau, L.-M. & Pesant, G. (2014). A constraint programming-based column generation approach for operating room planning and scheduling. Paper presented at the 11th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR 2014), Cork, Ireland (pp. 455-463). Retrieved from https://doi.org/10.1007/978-3-319-07046-9_32
  • 2013
    • Conference paper

      Rix, G., Pesant, G. & Rousseau, L.-M. (2013). A tactical transportation-driven harvest planning problem. Paper presented at the 8th Triennal Symposium on Transportation Analysis, San Pedro de Atacama, Chile.
    • Conference paper

      Sakti, A., Guéhéneuc, Y.-G. & Pesant, G. (2013). Constraint-based fitness function for search-based software testing. Paper presented at the 10th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2013), Berlin, Germany (pp. 378-85).
    • Conference paper

      Brockbank, S., Pesant, G. & Rousseau, L.-M. (2013). Counting spanning trees to guide search in constrained spanning tree problems. Paper presented at the 19th International Conference on Principles and Practice of Constraint Programming (CP 2013), Uppsala, Sweden (pp. 175-183).
    • Conference paper

      El-Mahi, O., Pesant, G., Nicolescu, G. & Beltrame, G. (2013). Embedded system verification through constraint-based scheduling. Paper presented at the International Symposium on Rapid System Prototyping (RSP 2013), Montréal, Québec (pp. 73-9).
  • 2012
    • Conference paper

      Rix, J.G., Pesant, G. & Rousseau, L.-M. (2012). A column generation algorithm to solve a multi-period synchronized log-truck scheduling problem. Paper presented at the 5th International Workshop on Freight Transportation and Logistics, Mikonos, Grèce.
    • Conference paper

      Sakti, A., Gueheneuc, Y.-G. & Pesant, G. (2012). Boosting search based testing by using constraint based testing. Paper presented at the 4th International Symposium on Search Based Software Engineering (SSBSE 2012), Riva del Garda, Italy (pp. 213-227).
    • Conference paper

      El-Mahi, O., Nicolescu, G., Pesant, G. & Beltrame, G. (2012). Embedded system verification through constraint-based scheduling. Paper presented at the IEEE International High Level Design Validation and Test Workshop (HLDVT 2012), Huntington Beach, CA (pp. 92-95).
    • Conference paper

      Frayret, J.-M., Meignan, D. & Pesant, G. (2012). Interactive planning system for forest road construction. Paper presented at the 4th International Conference on Information Systems, Logistics and Supply Chain (ILS 2012), Québec, Canada.
  • 2011
    • Conference paper

      Meignan, D., Frayret, J.-M. & Pesant, G. (2011). An interactive heuristic approach for the P-forest problem. Paper presented at the IEEE International Conference on Systems, Man, and Cybernetics (SMC 2011), Anchorage, AK, United states (pp. 1009-1013).
    • Conference paper

      Abdelilah, S., Guéhéneuc, Y.-G. & Pesant, G. (2011). CP-SST : approche basée sur la programmation par contraintes pour le test structurel du logiciel. Paper presented at the 7es Journées francophones de programmation par contraintes, Lyon, France (pp. 289-298).
    • Conference paper

      Bhattacharya, N., Sakti, A., Antoniol, G., Guéhéneuc, Y.-G. & Pesant, G. (2011). Divide-by-zero exception raising via branch coverage. Paper presented at the 3rd International Symposium on Search Based Software Engineering (SSBSE 2011), Szeged, Hungary (pp. 204-218).
    • Conference paper

      Lodi, A., Pesant, G. & Rousseau, L.-M. (2011). On counting lattice points and chvatal-gomory cutting planes. Paper presented at the 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011), Berlin, Germany (pp. 131-136). Retrieved from https://doi.org/10.1007/978-3-642-21311-3_13
    • Conference paper

      Bhattacharya, N., Sakti, A., Antoniol, G., Guéhéneuc, Y.-G. & Pesant, G. (2011). Performance analysis of metaheuristic and constraint programming approaches. Paper presented at the 4th International conference on Software Testing, Verification and Validation, Berlin, Germany.
    • Conference paper

      Pesant, G. & Zanarini, A. (2011). Recovering indirect solution densities for counting-based branching heuristics. Paper presented at the 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011), Berlin, Germany (pp. 170-175). Retrieved from https://doi.org/10.1007/978-3-642-21311-3_16
  • 2010
    • Conference paper

      Zanarini, A. & Pesant, G. (2010). More Robust counting-based Search Heuristics with Alldifferent Constraints. Paper presented at the 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010), Bologna, Italie (pp. 354-368).
  • 2009
    • Conference paper

      Gaudreault, J., Pesant, G., Frayret, J.-M. & D'amours, S. (2009). An adaptive search strategy for efficient distributed decision making. Paper presented at the Learning and Intelligent Optimization Conference, Trento, Italy.
    • Conference paper

      Le Bras, R., Zanarini, A. & Pesant, G. (2009). Efficient generic search heuristics within the embp framework. Paper presented at the 15th International Conference on Principles and Practice of Constraint Programming (CP 2009), Lisbon, Portugal (pp. 539-553).
    • Conference paper

      Pesant, G., Quimper, C.-G., Rousseau, L.-M. & Sellmann, M. (2009). The polytope of context-free grammar constraints. Paper presented at the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Pittsburgh, PA, USA (pp. 223-232).
  • 2008
    • Conference paper

      Pesant, G. & Quimper, C.-G. (2008). Counting solutions of knapsack constraints. Paper presented at the 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), Paris, France (pp. 203-217).
    • Conference paper

      Gaudreault, J., Frayret, J.-M., Pesant, G., Forget, P. & D'Amours, S. (2008). Operations coordination in the lumber industry: from heuristics sto machine learning. Paper presented at the 13th Annual International Conference on Industrial Engineering Theory, Applications & Practice, Las Vegas, Nevada.
    • Conference paper

      Galinier, P., Hertz, A., Paroz, S. & Pesant, G. (2008). Using local search to speed up filtering algorithms for some NP-hard constraints. Paper presented at the 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), Paris, France (pp. 298-302). Retrieved from https://doi.org/10.1007/978-3-540-68155-7_26
  • 2007
    • Conference paper

      Gaudreault, J., Frayret, J.-M. & Pesant, G. (2007). Discrepancy-based method for hierarchical distributed optimization. Paper presented at the 19th IEEE International Conference on Tools with Artificial Intelligence, Patras, Greece (pp. 75-81).
    • Conference paper

      Gaudreault, J., Frayret, J.-M. & Pesant, G. (2007). Discrepancy-based optimization for distributed supply chain operations planning. Paper presented at the 9th International Workshop on Distributed Constraint Reasoning, Providence, Rhode Island.
    • Conference paper

      Zanarini, A. & Pesant, G. (2007). Generalizations of the global cardinality constraint for hierarchical resources. Paper presented at the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2007), Brussels, Belgium (pp. 361-375).
    • Conference paper

      Zanarini, A. & Pesant, G. (2007). Solution counting algorithms for constraint-centered search heuristics. Paper presented at the 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), Providence, RI, United States (pp. 743-757).
  • 2006
    • Conference paper

      Zanarini, A., Milano, M. & Pesant, G. (2006). Improved algorithm for the soft global cardinality constraint. Paper presented at the 3rd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2006), Cork, Ireland (pp. 288-299).
    • Conference paper

      Van Hoeve, W.J., Pesant, G., Rousseau, L.M. & Sabharwal, A. (2006). Revisiting the Sequence Constraint. Paper presented at the 12th International Conference on Principles and Practice of Constraint Programming (CP 2006) (pp. 620-634).
  • 2005
    • Conference paper

      Demassey, S., Pesant, G. & Rousseau, L.-M. (2005). Constraint programming based column generation for employee timetabling. Paper presented at the 2nd International Conference (CPAIOR 2005), Prague, (CZ) (pp. 140-155). Retrieved from https://doi.org/10.1007/11493853_12
    • Conference paper

      Pesant, G. (2005). Counting Solutions of CSPs : A structural approach. Paper presented at the 19th International Joint Conference on Artificial Intelligence, Edinburgh (UK) (pp. 260-265).
    • Conference paper

      Gendron, B., Lebbah, H. & Pesant, G. (2005). Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation. Paper presented at the 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005), Prague, Czech Republic (pp. 217-227).
    • Conference paper

      Pesant, G. & Régin, J.-C. (2005). SPREAD : a balancing constraint based on statistics. Paper presented at the 11th International Conference on Principles and Practice of Constraint Programming (CP 2005), Sitges, Spain (pp. 460-474).
  • 2004
    • Conference paper

      Hellsten, L., Pesant, G. & Van Beek, P. (2004). A Domain Consistency Algorithm for the Stretch Constraint. Paper presented at the 10th International Conference on Principles and Practice of Constraint Programming (CP 2004) (pp. 290-304).
    • Conference paper

      Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. Paper presented at the 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), Toronto, Ont., Canada (pp. 482-495).
    • Conference paper

      van Hoeve, W.J., Pesant, G. & Rousseau, L.-M. (2004). On Global Warming (Softening Global Constraints). Paper presented at the Workshop on Preferences and Soft Constraints.
  • 2003
    • Conference paper

      Pomerleau, Y., Chamberland, S. & Pesant, G. (2003). A Constraint Programming Approach for the Design Problem of Cellular Wireless Networks. Paper presented at the Canadian Conference on Electrical and Computer Engineering (CCECE 2003) (pp. 881-884).
    • Conference paper

      Bourdais, S., Galinier, P. & Pesant, G. (2003). HIBISCUS: a constraint programming application to staff scheduling in health care. Paper presented at the 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland (pp. 153-167).
    • Conference paper

      Pesant, G. (2003). Regular language membership constraint for sequences of variables. Paper presented at the 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland (pp. 110-119).
    • Conference paper

      Rousseau, L.M., Gendreau, M. & Pesant, G. (2003). Synchronized vehicle dispatching problem. Paper presented at the Odysseus 2003, Palermo, IT.
  • 2002
    • Conference paper

      Amoussou, G., André, M., Pesant, G. & Pierre, S. (2002). Affectation de cellules à des commutateurs dans les réseaux cellulaires mobiles par programmation par contraintes. Paper presented at the Canadian Conference on Electrical and Computer Engineering (CCECE 2002), Winnipeg, Manitoba (pp. 1311-1316).
    • Conference paper

      Pesant, G. & Laporte, G. (2002). Algorithme robuste pour la confection d'horaires cycliques. Paper presented at the Journées francophones de programmation logique et programmation par contraintes (JFPLC 2002), Nice, France.
    • Conference paper

      Rousseau, L.-M., Gendreau, M. & Pesant, G. (2002). Solving small VRPTWs with constraint programming based column generation. Paper presented at the International Symposium on Combinatorial Optimization, Paris, France.
    • Conference paper

      André, M., Pesant, G. & Pierre, S. (2002). Using tabu search for assigning cells to switches in mobile cellular networks. Paper presented at the 21st Biennal Symposium on Communications, Kingston (pp. 129-133).
  • 2001
    • Conference paper

      Amoussou, G., Pesant, G. & Pierre, S. (2001). Affectation de cellules à des commutateurs par programmation par contraintes. Paper presented at the Canadian Conference on Electrical and Computer Engineering (CCECE 2001), Toronto, Ont., Canada (pp. 1017-1022).
    • Conference paper

      Pesant, G. (2001). A filtering algorithm for the stretch constraint, principles and practice of constraint programming. Paper presented at the 7th International Conference on Principles and Practice of Constraint Programming (CP 2001), Paphos CYP (pp. 183-195).
    • Conference paper

      Rousseau, L.-M., Pesant, G. & Gendreau, M. (2001). Building negative reduced cost paths using constraint programming. Paper presented at the 7th International Conference on Principles and Practice of Constraint Programming (CP 2001), Paphos (pp. 778).
    • Conference paper

      Galinier, P., Jaumard, B., Morales, R. & Pesant, G. (2001). Constraint-based approach to the Golomb ruler problem. Paper presented at the 3rd International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2001), Ashford, UK.
  • 2000
    • Conference paper

      Rousseau, L.-M., Gendreau, M. & Pesant, G. (2000). A Hybrid Algorithm to Solve Physician Rostering Problem. Paper presented at the 2nd Workshop on Integration of AI and OR Techniques in constraint Programming for Combinatorial Optimization Problems.
  • 1999
    • Conference paper

      Rousseau, L.-M., Gendreau, M. & Pesant, G. (1999). Hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules. Paper presented at the Journées francophones de programmation logique et programmation par contraintes (JFPLC 1999), Lyon, France (pp. 145-160).
    • Conference paper

      Rousseau, L.-M., Gendreau, M. & Pesant, G. (1999). Une hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules. Paper presented at the 8es Journées francophones de programmation logique et programmation par contraintes (pp. 145-160).
    • Conference paper

      Rousseau, L.-M., Gendreau, M. & Pesant, G. (1999). Using constraint-based operators with Variable Neighborhood Search to solve the Vehicle Routing Problem with Time Windows. Paper presented at the 1st Workshop on Integration of AI and OR Techniques in constraint Programming for Combinatorial Optimization Problems.
  • 1997
    • Conference paper

      Pesant, G., Gendreau, M. & Rousseau, J.-M. (1997). GENIUS-CP: a generic single-vehicle routing algorithm. Paper presented at the 3rd International Conference on Principles and Practice of Constraint Programming (CP 1997), Linz (pp. 420-434).
    • Conference paper

      Pesant, G., Séguin, R. & Soriano, P. (1997). High school timetabling by constraint programming. Paper presented at the 2nd international conference on the practice and theory of automated timetabling (PATAT 1997), Toronto, Canada (pp. 340-344).
  • 1996
    • Conference paper

      Pesant, G. & Gendreau, M. (1996). View of local search in constraint programming. Paper presented at the 2nd International Conference on Principles and Practice of Constraint Programming (CP 1996), Cambridge, US (pp. 353-366).
• Book chapters (2)
  • 2005
    • Book chapter

      Soumis, F., Pesant, G. & Rousseau, L.-M. (2005). Gestion des horaires et affectations du personnel. In Gestion de production et ressources humaines : Méthodes de planification dans les systèmes productifs (pp. 71-111). Montréal, Québec: Pressses Polytechnique.
    • Book chapter

      Pesant, G. & Rousseau, L.-M. (2005). Programmation par contraintes. In Gestion de production et ressources humaines : Méthodes de planification dans les systèmes productifs (pp. 223-247). Montréal, Québec: Presses Polytechnique.
• Reports (2)
  • 2017
    • Report

      Olivier, G., Lodi, A. & Pesant, G. (2017). A comparison of optimization methods for multi-objective contrained bin packing problems (Report No DS4DM-2017-015). Canada Excellence Research Chair. Retrieved from http://cerc-datascience.polymtl.ca/wp-content/uploads/2018/01/Technical-Report_DS4DM_2017_015.pdf
  • 2014
    • Report

      Rix, G., Rousseau, L.-M. & Pesant, G. (2014). A transportation-driven approach to annual harvest planning (Report No CIRRELT-2014-24). CIRRELT. Retrieved from https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2014-24.pdf