 | Monter d'un niveau |
Guy DesaulniersDépartement de mathématiques et de génie industriel
Voir sa fiche dans le Répertoire des Expertises de Polytechnique Montréal
Réseau de collaborationCe graphique trace les liens entre tous les collaborateurs des publications de {} figurant sur cette page.
Chaque lien représente une collaboration sur la même publication. L'épaisseur du lien représente le nombre de collaborations.
Utilisez la molette de la souris ou les gestes de défilement pour zoomer à l'intérieur du graphique.
Vous pouvez cliquer sur les noeuds et les liens pour les mettre en surbrillance et déplacer les noeuds en les glissant.
Enfoncez la touche "Ctrl" ou la touche "⌘" en cliquant sur les noeuds pour ouvrir la liste des publications de cette personne.
Nuage de motsUn nuage de mots est une représentation visuelle des mots les plus fréquemment utilisés dans un texte ou un ensemble de textes. Les mots apparaissent dans différentes tailles, la taille de chaque mot étant proportionnelle à sa fréquence d'apparition dans le texte. Plus un mot est utilisé fréquemment, plus il apparaît en grand dans le nuage de mots. Cette technique permet de visualiser rapidement les thèmes et les concepts les plus importants d'un texte.
Dans le contexte de cette page, le nuage de mots a été généré à partir des publications de l'auteur {}. Les mots présents dans ce nuage proviennent des titres, résumés et mots-clés des articles et travaux de recherche de cet auteur. En analysant ce nuage de mots, vous pouvez obtenir un aperçu des sujets et des domaines de recherche les plus récurrents et significatifs dans les travaux de cet auteur.Le nuage de mots est un outil utile pour identifier les tendances et les thèmes principaux dans un corpus de textes, facilitant ainsi la compréhension et l'analyse des contenus de manière visuelle et intuitive.
Azéma, M., Desaulniers, G., Mendoza, J. E., & Pesant, G. (mai 2024). A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints [Communication écrite]. 21st International Conference on Integration of Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR 2024), Uppsala, Sweden. Lien externe
Altman, C., Desaulniers, G., & Errico, F. (2023). The Fragility-Constrained Vehicle Routing Problem with Time Windows. Transportation Science, 57(2), 552-572. Lien externe
Azevedo da Costa, L. C., Contardo, C., Desaulniers, G., & Pecin, D. (2021). Selective arc-ng pricing for vehicle routing. International Transactions in Operational Research, 28(5), 2633-2690. Lien externe
Altman, C., Desaulniers, G., & Errico, F. (2020). The fragility-constrained vehicle routing problem with time windows. (Rapport technique n° G-2020-78). Lien externe
Azevedo da Costa, L. C., Contardo, C., Desaulniers, G., & Pecin, D. G. (2020). Selective arc-ng pricing for vehicle routing. (Rapport technique n° G-2020-07). Lien externe
Attia, D., Bürgy, R., Desaulniers, G., & Soumis, F. (2019). A decomposition-based heuristic for large employee scheduling problems with inter-department transfers. (Rapport technique n° G-2019-13). Lien externe
Attia, D., Bürgy, R., Desaulniers, G., & Soumis, F. (2019). A decomposition-based heuristic for large employee scheduling problems with inter-department transfers. EURO Journal on Computational Optimization, 7(4), 325-357. Lien externe
Azevedo da Costa, L. C., Contardo, C., & Desaulniers, G. (2018). Exact branch-price-and-cut algorithms for vehicle routing. (Rapport technique n° G-2018-41). Lien externe
Archetti, C., Desaulniers, G., & Speranza, M. G. (2017). Minimizing the logistic ratio in the inventory routing problem. EURO Journal on Transportation and Logistics, 6(4), 289-306. Disponible
Andersson, H., Christiansen, M., Desaulniers, G., & Rakke, J. G. (2017). Creating annual delivery programs of liquefied natural gas. Optimization and Engineering, 18(1), 299-316. Lien externe
Archetti, C., Desaulniers, G., & Speranza, M. G. (2016). Minimizing the logistic ratio in the inventory routing problem. (Rapport technique n° G-2016-08). Lien externe
Andersson, H., Christiansen, M., & Desaulniers, G. (2016). A new decomposition algorithm for a liquefied natural gas inventory routing problem. International Journal of Production Research, 54(2), 564-578. Lien externe
Archetti, C., Bouchard, M., & Desaulniers, G. (2011). Enhanced branch and price and cut for vehicle routing with split deliveries and time windows. Transportation Science, 45(3), 285-298. Lien externe
Andersson, H., Christiansen, M., & Desaulniers, G. (juin 2010). A New Decomposition Approach for a Liquefied Natural Gas Inventory Routing Problem [Communication écrite]. 7th Triennal Symposium on Transportation Analysis (Tristan VII), Tromsø, Norway. Lien externe
Archetti, C., Bouchard, M., & Desaulniers, G. (2009). Enhanced Branch-and-Price-and-Cut for Vehicle Routing with Split Deliveries and Time Windows. (Rapport technique n° G-2009-81). Lien externe
Achour, H., Gamache, M., Soumis, F., & Desaulniers, G. (2007). An Exact Solution Approach for the Preferential Bidding System Problem in the Airline Industry. Transportation Science, 41(3), 354-365. Lien externe
Achour, H., Gamache, M., Soumis, F., & Desaulniers, G. (2004). An Exact Solution Approach for the PBS Problem. (Rapport technique n° G-2004-89). Lien externe
Bretin, A., Desaulniers, G., & Rousseau, L.-M. (2021). Compact routes for parcel delivery by postal services. (Rapport technique n° G-2021-04). Lien externe
Baller, A. C., Dabia, S., Desaulniers, G., & Dullaert, W. E. H. (2021). The Inventory routing problem with demand moves. SN Operations Research Forum, 2(1), 6 (61 pages). Disponible
Bretin, A., Desaulniers, G., & Rousseau, L.-M. (2021). The traveling salesman problem with time windows in postal services. Journal of the Operational Research Society, 72(2), 383-397. Lien externe
Baller, A., Dabia, S., Desaulniers, G., & Dullaert, W. E. H. (2019). The inventory routing problem with demand moves. (Rapport technique n° G-2019-20). Lien externe
Bagger, N.-C. F., Desaulniers, G., & Desrosiers, J. (2019). Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem. Journal of Scheduling, 22(2), 155-172. Lien externe
Bürgy, R., Michon-Lacaze, H., & Desaulniers, G. (2019). Employee scheduling with short demand perturbations and extensible shifts. Omega-International Journal of Management Science, 89, 177-192. Lien externe
Bretin, A., Desaulniers, G., & Rousseau, L.-M. (2018). Traveling salesman problem with time windows in postal services. (Rapport technique n° G-2018-30). Lien externe
Bürgy, R., Michon-Lacaze, H., & Desaulniers, G. (2018). Employee scheduling with short demand perturbations and extensible shifts. (Rapport technique n° G-2018-18). Lien externe
Borzou, R., Desaulniers, G., Fausto, E., & Lodi, A. (2018). A PCA-based approximation scheme for combinatorial optimization with uncertain and correlated data. (Rapport technique n° DS4DM-2018-002). Lien externe
Bouarab, H., Desaulniers, G., Desrosiers, J., & Gauthier, J. B. (2017). Linear fractional approximations for master problems in column generation. Operations Research Letters, 45(5), 503-507. Lien externe
Bouarab, H., Desaulniers, G., & Desrosiers, J. (2015). A linear fractional pricing problem for solving linear programs. (Rapport technique n° G-2015-82). Lien externe
Brouer, B. D., Desaulniers, G., Karsten, C. V., & Pisinger, D. (septembre 2015). A matheuristic for the liner shipping network design problem with transit time restrictions [Communication écrite]. 6th International Conference on Computational Logistics (ICCL 2015), Delft, Netherlands. Lien externe
Brouer, B. D., Desaulniers, G., & Pisinger, D. (2014). A matheuristic for the liner shipping network design problem. (Rapport technique n° G-2014-30). Lien externe
Benavent, E., Corberán, Á., Desaulniers, G., Lessard, F., Plana, I., & Sanchis, J. M. (2014). A Branch-Price-and-Cut Algorithm for the Min-Max K-Vehicle Windy Rural Postman Problem. Networks, 63(1), 34-45. Lien externe
Brouer, B. D., Desaulniers, G., & Pisinger, D. (2014). A matheuristic for the liner shipping network design problem. Transportation Research Part E: Logistics and Transportation Review, 72, 42-59. Lien externe
Benchimol, P., Desaulniers, G., & Desrosiers, J. (2012). Stabilized Dynamic Constraint Aggregation for Solving Set Partitioning Problems. (Rapport technique n° G-2011-56). Lien externe
Benchimol, P., Desaulniers, G., & Desrosiers, J. (2012). Stabilized dynamic constraint aggregation for solving set partitioning problems. European Journal of Operational Research, 223(2), 360-371. Lien externe
Benavent, E., Corberán, Á., Desaulniers, G., Lessard, F., Plana, I., & Sanchis, J. M. (2011). A Branch-Price-and-Cut Algorithm for the Min-Max k-Vehicle Windy Rural Postman Problem. (Rapport technique n° G-2011-65). Lien externe
Boubaker, K., Desaulniers, G., & El Hallaoui, I. (2010). Bidline scheduling with equity by heuristic dynamic constraint aggregation. Transportation Research. Part B, Methodological, 44(1), 50-61. Lien externe
Bouchard, M., Hertz, A., & Desaulniers, G. (2009). Lower bounds and a tabu search algorithm for the minimum deficiency problem. Journal of Combinatorial Optimization, 17(2), 168-191. Lien externe
Boubaker, K., Desaulniers, G., & El Hallaoui, I. (2008). Bidline Scheduling with Equity by Heuristic Dynamic Constraint Aggregation. (Rapport technique n° G-2008-43). Lien externe
Bouchard, M., Hertz, A., & Desaulniers, G. (2007). Lower Bounds and a Tabu Search Algorithm for the Minimum Deficiency Problem. (Rapport technique n° G-2007-14). Lien externe
Bélanger, N., Desaulniers, G., Soumis, F., & Desrosiers, J. (2006). Periodic Airline Fleet Assignment With Time Windows, Spacing Constraints, and Time Dependent Revenues. European Journal of Operational Research, 175(3), 1754-1766. Lien externe
Bélanger, N., Desaulniers, G., Soumis, F., Desrosiers, J., & Lavigne, J. (2006). Weekly Airline Fleet Assignment With Homogeneity. Transportation Research. Part B, Methodological, 40(4), 306-318. Lien externe
Bélanger, N., Desaulniers, G., Soumis, F., & Desrosiers, J. (2005). Periodic Airline Fleet Assignment with Time Windows, Spacing Constraints, and Time Dependent Revenues. (Rapport technique). Lien externe
Bélanger, N., Desaulniers, G., Soumis, F., & Desrosiers, J. (2005). Weekly Airline Fleet Assignment with Homogeneity. (Rapport technique n° G-2002-70). Lien externe
Bodart, L., Desaulniers, G., Desrosiers, J., & Solomon, M. M. (juin 2004). Integrated Bus and Driver Scheduling [Communication écrite]. 5th Triennal Symposium on Transportation Analysis (Tristan V), Le Gosier, Guadeloupe (4 pages). Lien externe
Costa, L., Contardo, C., Desaulniers, G., & Yarkony, J. (2022). Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows. INFORMS Journal on Computing, 34(2), 1141-1156. Lien externe
Costa, L., Contardo, C., Desaulniers, G., & Yarkony, J. (2020). Stabilized column generation via the dynamic separation of aggregated rows. (Rapport technique n° G-2020-36). Lien externe
Costa, L., Contardo, C., & Desaulniers, G. (2019). Exact Branch-Price-and-Cut Algorithms for Vehicle Routing. Transportation Science, 53(4), 946-985. Lien externe
Cherkesly, M., Desaulniers, G., Irnich, S., & Laporte, G. (2016). Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. European Journal of Operational Research, 250(3), 782-793. Lien externe
Cherkesly, M., Desaulniers, G., Irnich, S., & Laporte, G. (2015). Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. (Rapport technique n° G-2015-25). Lien externe
Cherkesly, M., Desaulniers, G., & Laporte, G. (2015). Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading. Transportation Science, 49(4), 752-766. Lien externe
Cherkesly, M., Desaulniers, G., & Laporte, G. (2015). A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Computers and Operations Research, 62, 23-35. Lien externe
Contardo, C., Desaulniers, G., & Lessard, F. (2015). Reaching the elementary lower bound in the vehicle routing problem with time windows. Networks, 65(1), 88-99. Lien externe
Cherkesly, M., Desaulniers, G., & Laporte, G. (2014). A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. (Rapport technique n° G-2014-66). Lien externe
Contardo, C., Desaulniers, G., & Lessard, F. (2013). Reaching the Elementary Lower Bound in the Vehicle Routing Problem with Time Windows. (Rapport technique n° G-2013-50). Lien externe
Cherkesly, M., Desaulniers, G., & Laporte, G. (2013). Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and LIFO Loading. (Rapport technique n° G-2013-31). Lien externe
Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M. M., & Soumis, F. (2002). VRP with time windows. Dans Toth, P., & Vigo, D. (édit.), The vehicle routing problem (p. 157-193). Lien externe
Cordeau, J.-F., Desaulniers, G., Lingaya, N., Soumis, F., & Desrosiers, J. (2001). Simultaneous Locomotive and Car Assignment at Via Rail Canada. Transportation Research. Part B, Methodological, 35(8), 767-787. Lien externe
Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M. M., & Soumis, F. (2000). The VRP with Time Windows. (Rapport technique n° G-99-13). Lien externe
Cordeau, J.-F., Desaulniers, G., Lingaya, N., Soumis, F., & Desrosiers, J. (1998). Simultaneous Locomotive and Car Assignment at VIA Rail Canada. (Rapport technique n° G-98-61). Lien externe
Desrosiers, J., Lübbecke, M., Desaulniers, G., & Gauthier, J. B. (2024). Branch-and-Price. (Rapport technique n° G-2024-36). Lien externe
Desaulniers, G., Yamín, D., & Mendoza, J. E. (mai 2024). The electric vehicle routing and overnight charging scheduling problem on a multigraph [Communication écrite]. 9th international workshop on freight transportation and logistics (ODYSSEUS 2024), Carmona, Spain. Lien externe
Dalmeijer, K., & Desaulniers, G. (2021). Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem. INFORMS Journal on Computing, 33(2), 495-510. Lien externe
Desaulniers, G., Lessard, F., Saddoune, M., & Soumis, F. (2020). Dynamic constraint aggregation for solving very large-scale airline crew pairing problems. (Rapport technique n° G-2020-21). Lien externe
Desaulniers, G., Lessard, F., Saddoune, M., & Soumis, F. (2020). Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems. SN Operations Research Forum, 1(3), 23 pages. Lien externe
Dahmen, S., Rekik, M., Soumis, F., & Desaulniers, G. (2020). A two-stage solution approach for personalized multi-department multi-day shift scheduling. European Journal of Operational Research, 280(3), 1051-1063. Lien externe
Desaulniers, G., Gschwind, T., & Irnich, S. (2020). Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models. Transportation Science, 54(5), 1170-1188. Lien externe
Desaulniers, G., Gschwind, T., & Irnich, S. (2019). Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models. (Rapport technique n° G-2019-48). Lien externe
Desaulniers, G., Pecin, D., & Contardo, C. (2019). Selective pricing in branch-price-and-cut algorithms for vehicle routing. EURO Journal on Transportation and Logistics, 8(2), 147-168. Disponible
Dayarian, I., & Desaulniers, G. (2019). A Branch-Price-and-Cut Algorithm for a Production-Routing Problem with Short-Life-Span Products. Transportation Science, 53(3), 829-849. Lien externe
Dalmeijer, K., & Desaulniers, G. (2018). Addressing orientation-symmetry in the Time Window Assignment Vehicle Routing Problem. (Rapport technique n° G-2018-48). Lien externe
Dahmen, S., Rekik, M., Soumis, F., & Desaulniers, G. (2018). A two-stage solution approach for personalized multi-department multi-day shift scheduling. (Rapport technique n° G-2018-46). Lien externe
Desfontaines, L., & Desaulniers, G. (2018). Multiple depot vehicle scheduling with controlled trip shifting. Transportation Research Part B: Methodological, 113, 34-53. Lien externe
Desfontaines, L., & Desaulniers, G. (2017). Multiple depot vehicle scheduling with controlled trip shifting. (Rapport technique n° G-2017-101). Lien externe
Desaulniers, G., Pecin, D., & Contardo, C. (2016). Selective pricing in branch-price-and-cut algorithms for vehicle routing. (Rapport technique n° G-2016-110). Lien externe
Dayarian, I., & Desaulniers, G. (2016). A Branch-Price-and-Cut algorithm for a production-routing problem with short-lifespan products. (Rapport technique n° G-2016-41). Lien externe
Desaulniers, G., Rakke, J. G., & Coelho, L. C. (2016). A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem. Transportation Science, 50(3), 1060-1076. Lien externe
Desaulniers, G., Errico, F., Irnich, S., & Schneider, M. (2016). Exact algorithms for electric vehicle-routing problems with time windows. Operations Research, 64(6), 1388-1405. Lien externe
de Fréminville, P., Desaulniers, G., Rousseau, L.-M., & Perron, S. (2015). A column generation heuristic for districting the price of a financial product. Journal of the Operational Research Society, 66(6), 965-978. Lien externe
Desaulniers, G., Errico, F., Irnich, S., & Schneider, M. (2014). Exact algorithms for electric vehicle-routing problems with time windows. (Rapport technique n° G-2014-110). Lien externe
Desaulniers, G., Rakke, J. G., & Coelho, L. C. (2014). A branch-price-and-cut algorithm for the inventory-routing problem. (Rapport technique n° G-2014-19). Lien externe
Desaulniers, G., Madsen, O. B. G., & Ropke, S. (2014). The vehicle routing problem with time windows. Dans Toth, P., & Vigo, D. (édit.), Vehicle routing: Problems, methods, and applications (2e éd., p. 119-159). Lien externe
de Fréminville, P., Desaulniers, G., Rousseau, L.-M., & Perron, S. (2013). A Column Generation Heuristic for Districting the Price of a Financial Product. (Rapport technique n° G-2013-22). Lien externe
Desaulniers, G., Rakke, J. G., & Coelho, L. C. (juin 2013). Branch-price-and-cut for inventory routing under a maximum level replenishment policy [Communication écrite]. 8th Triennal Symposium on Transportation Analysis (Tristan VIII), San Pedro de Atacama, Chile. Lien externe
Desaulniers, G., Desrosiers, J., & Spoorendonk, S. (2011). Cutting planes for branch-and-price algorithms. Networks, 58(4), 301-310. Lien externe
Desaulniers, G., El Hallaoui, I., Saddoune, M., & Soumis, F. (2010). Integrated Airline Crew Scheduling: A Bi-Dynamic Constraint Aggregation Method using Neighborhoods. (Rapport technique n° G-2010-21). Lien externe
Desaulniers, G., Desrosiers, J., & Spoorendonk, S. (2010). The Vehicle Routing Problem with Time Windows: State-of-the-Art Exact Solution Methods. (Rapport technique n° G-2010-22). Lien externe
Desaulniers, G. (2010). Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Operations Research, 58(1), 179-192. Lien externe
Desaulniers, G., Prescott-Gagnon, É., & Rousseau, L.-M. (juin 2010). Large neighborhood search heuristics for propane delivery [Communication écrite]. 7th Triennal Symposium on Transportation Analysis (Tristan VII), Tromsø, Norway. Lien externe
Desaulniers, G., Desrosiers, J., & Spoorendonk, S. (2010). The Vehicle routing problem with time windows : State-of -the-art exact solution methods. Dans Wiley Encyclopedia of Operations Research and Management Science . Lien externe
Desaulniers, G., Desrosiers, J., & Spoorendonk, S. (2009). Cutting Planes for Branch-and-Price Algorithms. (Rapport technique n° G-2009-52). Lien externe
Desaulniers, G. (2008). Branch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows. (Rapport technique n° G-2008-32). Lien externe
Desaulniers, G., Lessard, F., & Hadjar, A. (2008). Tabu Search, Partial Elementarity, and Generalized K-Path Inequalities for the Vehicle Routing Problem With Time Windows. Transportation Science, 42(3), 387-404. Lien externe
Desaulniers, G., Prescott-Gagnon, É., & Rousseau, L.-M. (juin 2007). A large neighborhood search algorithm for the vehicle routing problem with time windows [Communication écrite]. 6th Triennial Symposium on Transportation Analysis (TRISTAN VI), Phuket, Thailand. Lien externe
Desaulniers, G. (2007). Managing Large Fixed Costs in Vehicle Routing and Crew Scheduling Problems Solved by Column Generation. Computers & Operations Research, 34(4), 1221-1239. Lien externe
Desaulniers, G., & Hickman, M. (2007). Public transit. Dans Handbooks Operations Research and Management Science (Vol. 14, p. 69-127). Lien externe
Desaulniers, G., Lessard, F., & Hadjar, A. (2006). Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows. (Rapport technique n° G-2006-45). Lien externe
Desaulniers, G. (2005). Managing Large Fixed Costs in Vehicle Routing and Crew Scheduling Problems Solved by Column Generation. (Rapport technique n° G-2005-28). Lien externe
Desaulniers, G., Desrosiers, J., & Solomon, M. M. (2005). Column Generation. Lien externe
Desaulniers, G., & Hickman, M. (2003). Public Transit. (Rapport technique n° G-2003-77). Lien externe
Desaulniers, G., Langevin, A., Riopel, D., & Villeneuve, B. (2003). Dispatching and Conflict-Free Routing of Automated Guided Vehicles : an Exact Approach. International Journal of Flexible Manufacturing Systems, 15(4), 309-331. Lien externe
Desaulniers, G., Langevin, A., Riopel, D., & Villeneuve, B. (2002). Dispatching and conflict-free routing of automated guided vehicles : an exact approach. (Rapport technique n° G-2002-31). Lien externe
Desaulniers, G., Desrosiers, J., & Solomon, M. M. (2002). Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems. Dans Ribeiro, C. C., & Hansen, P. (édit.), Essays and Surveys in Metaheuristics (p. 309-324). Lien externe
Desaulniers, G., Desrosiers, J., & Solomon, M. M. (janvier 1999). Accelerating strategies for column generation methods in vehicle routing and crew scheduling problems [Communication écrite]. 3rd Metaheuristics International Conference (MIC 1999), Angra dos Reis, Brazil. Non disponible
Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M. M., & Soumis, F. (2002). VRP with pickup and delivery. Dans Toth, P., & Vigo, D. (édit.), The vehicle routing problem (p. 225-242). Lien externe
Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M. M., & Soumis, F. (2000). The VRP with Pickup and Delivery. (Rapport technique n° G-2000-25). Lien externe
Desaulniers, G., & Villeneuve, D. (2000). Shortest Path Problem With Time Windows and Linear Waiting Costs. Transportation Science, 34(3), 312-319. Lien externe
Desaulniers, G., Desrosiers, J., Lasry, A., & Solomon, M. M. Crew Pairing for a Regional Carrier [Communication écrite]. Computer-Aided Transit Scheduling. Lien externe
Desaulniers, G., & Villeneuve, D. (1998). The Shortest Path Problem with Time Windows and Linear Waiting Costs. (Rapport technique n° G-97-21). Lien externe
Desaulniers, G., Desrosiers, J., Lasry, A., & Solomon, M. M. (1998). Crew Pairing for a Regional Carrier. (Rapport technique n° G-97-33). Lien externe
Desaulniers, G., Desrosiers, J., Gamache, M., & Soumis, F. (1998). Crew Scheduling in Air Transportation. Dans Fleet management and logistics (p. 169-185). Lien externe
Desaulniers, G., Lavigne, J., & Soumis, F. (1998). Multi-depot vehicle scheduling problems with time windows and waiting costs. European Journal of Operational Research, 111(3), 479-494. Lien externe
Desaulniers, G., Soumis, F., & Laurent, J.-C. (1998). Shortest Path Algorithm for a Carlike Robot in a Polygonal Environment. International Journal of Robotics Research, 17(5), 512-530. Lien externe
Desaulniers, G., Desrosiers, J., Ioachim, I., Solomon, M. M., Soumis, F., & Villeneuve, D. (1998). Unified framework for deterministic time constrained vehice routing and crew scheduling problems. Dans Fleet management and logistics (p. 57-93). Lien externe
Desaulniers, G., Desrosiers, J., Gamache, M., & Soumis, F. (1997). Crew Scheduling in Air Transportation. (Rapport technique n° G-97-26). Lien externe
Desaulniers, G., Desrosiers, J., Ioachim, I., Solomon, M. M., Soumis, F., & Villeneuve, D. (1997). A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems. (Rapport technique n° G-94-46). Lien externe
Desaulniers, G., Desrosiers, J., Dumas, Y., Marc, S., Rioux, B., Solomon, M. M., & Soumis, F. (1997). Crew pairing at Air France. European Journal of Operational Research, 97(2), 245-259. Lien externe
Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1997). Daily aircraft routing and scheduling. Management Science, 43(6), 841-854. Lien externe
Desaulniers, G., Soumis, F., & Laurent, J.-C. (1996). A Shortest Path Algorithm for a Car-Like Robot in a Polygonal Environment. (Rapport technique n° G-95-43). Lien externe
Desaulniers, G., Lavigne, J., & Soumis, F. (1996). Multi-Depot Vehicle Scheduling Problems with Time Windows and Waiting Costs. (Rapport technique n° G-96-33). Lien externe
Desaulniers, G., Desrosiers, J., Dumas, Y., Marc, S., Rioux, B., Solomon, M. M., & Soumis, F. (1996). Crew Pairing at Air France. (Rapport technique n° G-93-39). Lien externe
Desaulniers, G. (1996). On shortest paths for a car-like robot maneuvering around obstacles. Robotics and Autonomous Systems, 17(3), 139-148. Lien externe
Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995). Daily Aircraft Routing and Scheduling. (Rapport technique n° G-94-21). Lien externe
Desaulniers, G., Dubuc, S., & Soumis, F. (1995). Comparaisons de longueurs de courbes et d'aires de surfaces. Annales des sciences mathématiques du Québec, 17(1), 39-51. Lien externe
Desaulniers, G., & Soumis, F. (1995). Efficient algorithm to find a shortest path for a car-like robot. IEEE Transactions on Robotics and Automation, 11(6), 819-828. Lien externe
Desaulniers, G., & Soumis, F. (1993). On Shortest Paths for a Mobile Robot in a Convex Cell. (Rapport technique n° G-93-22). Lien externe
Desaulniers, G., & Soumis, F. (1993). An Efficient Algorithm to Find a Shortest path for a Car-like Robot. (Rapport technique n° G-93-18). Lien externe
Desaulniers, G., & Soumis, F. (1992). On Minimal Length Trajectories for Mobile Robots with Kinematic Constraints. (Rapport technique n° G-92-44). Lien externe
Er-Rbib, S., Desaulniers, G., El Hallaoui, I., & Bani, A. (2021). Integrated and sequential solution methods for the cyclic bus driver rostering problem. Journal of the Operational Research Society, 72(4), 764-779. Lien externe
Er-Rbib, S., Desaulniers, G., El Hallaoui, I., & Munroe, P. (2021). Preference-based and cyclic bus driver rostering problem with fixed days off. Public Transport, 13(2), 251-286. Lien externe
Er-Rbib, S., Desaulniers, G., El Hallaoui, I., & Munroe, P. (2020). Preference-based and cyclic bus driver rostering problem with fixed days off. (Rapport technique n° G-2020-69). Lien externe
Er-Rbib, S., Bani, A., Desaulniers, G., & El Hallaoui, I. (2019). Integrated and sequential solution methods for the cyclic bus driver rostering problem. (Rapport technique n° G-2019-11). Lien externe
Errico, F., Desaulniers, G., Gendreau, M., Rei, W., & Rousseau, L.-M. (2018). The vehicle routing problem with hard time windows and stochastic service times. EURO Journal on Transportation and Logistics, 7(3), 223-251. Disponible
Errico, F., Desaulniers, G., Gendreau, M., Rei, W., & Rousseau, L.-M. (2016). A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. European Journal of Operational Research, 249(1), 55-66. Lien externe
Errico, F., Desaulniers, G., Gendreau, M., Rei, W., & Rousseau, L.-M. (2014). A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. (Rapport technique n° G-2014-05). Lien externe
Errico, F., Desaulniers, G., Gendreau, M., Rei, W., & Rousseau, L.-M. (2013). The vehicle routing problem with hard time windows and stochastic service times. (Rapport technique n° G-2013-45). Lien externe
Elahipanah, M., Desaulniers, G., & Lacasse-Guay, È. (2013). A Two-Phase Mathematical-Programming Heuristic for Flexible Assignment of Activities and Tasks to Work Shifts. Journal of Scheduling, 16(5), 443-460. Lien externe
Errico, F., Desaulniers, G., Gendreau, M., Rei, W., & Rousseau, L.-M. (juin 2013). Vehicle routing problem with hard time windows and stochastic service times [Communication écrite]. 8th Triennal Symposium on Transportation Analysis (Tristan VIII), San Pedro de Atacama, Chile. Lien externe
Elahipanah, M., Desaulniers, G., & Lacasse-Guay, È. (2011). Two-Phase Mathematical-Programming Heuristic for Flexible Assignment of Activities and Tasks to Work Shifts. (Rapport technique n° G-2011-23). Lien externe
El Hallaoui, I., Metrane, A., Desaulniers, G., & Soumis, F. (2011). An Improved Primal Simplex Algorithm for Degenerate Linear Programs. INFORMS Journal on Computing, 23(4), 569-577. Lien externe
El Hallaoui, I., Metrane, A., Soumis, F., & Desaulniers, G. (2010). Multi-phase dynamic constraint aggregation for set partitioning type problems. Mathematical Programming, 123(2), 345-370. Lien externe
El Hallaoui, I., Desaulniers, G., Metrane, A., & Soumis, F. (2008). Bi-dynamic constraint aggregation and subproblem reduction. Computers & Operations Research, 35(5), 1713-1724. Lien externe
El Hallaoui, I., Metrane, A., Desaulniers, G., & Soumis, F. (2007). An Improved Primal Simplex Algorithm for Degenerate Linear Programs. (Rapport technique n° G-2007-66). Lien externe
El Hallaoui, I., Villeneuve, D., Soumis, F., & Desaulniers, G. (2005). Dynamic aggregation of set-partitioning constraints in column generation. Operations Research, 53(4), 632-645. Lien externe
El Hallaoui, I., Villeneuve, D., Soumis, F., & Desaulniers, G. (2004). Dynamic Aggregation of Set Partitioning Constraints in Column Generation. (Rapport technique n° G-2003-45). Lien externe
Fink, M., Desaulniers, G., Frey, M., Kiermaier, F., Kolisch, R., & Soumis, F. (2019). Column generation for vehicle routing problems with multiple synchronization constraints. European Journal of Operational Research, 272(2), 699-711. Lien externe
Fink Bagger, N.-C., Desaulniers, G., & Desrosiers, J. (2016). Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem. (Rapport technique n° G-2016-71). Lien externe
Fink, M., Desaulniers, G., Frey, M., Kiermaier, F., Kolisch, R., & Soumis, F. (2016). Column generation for vehicle routing problems with multiple synchronization constraints. (Rapport technique n° G-2016-63). Lien externe
Fink Bagger, N.-C., Desaulniers, G., & Desrosiers, J. (août 2016). Daily pattern formulation and valid inequalities for the curriculum-based course timetabling problem [Résumé]. 11th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2016), Udine, Italy. Lien externe
Gerbaux, J., Desaulniers, G., & Cappart, Q. (2025). A machine-learning-based column generation heuristic for electric bus scheduling. Computers & Operations Research, 173, 106848 (14 pages). Lien externe
Gerbaux, J., Cappart, Q., & Desaulniers, G. (2024). A machine-learning-based column generation heuristic for electric bus scheduling. (Rapport technique n° G-2024-13). Lien externe
Groiez, M., Desaulniers, G., & Marcotte, O. (2015). Valid inequalities and separation algorithms for the set partitioning problem. (Rapport technique n° G-2014-14). Lien externe
Gauvin, C., Desaulniers, G., & Gendreau, M. (2014). A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. Computers and Operations Research, 50, 141-153. Lien externe
Groiez, M., Desaulniers, G., & Marcotte, O. (2014). Valid inequalities and separation algorithms for the set partitioning problem. INFOR, 52(4), 185-196. Lien externe
Gauvin, C., Desaulniers, G., & Gendreau, M. (2013). A Branch-Cut-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands. (Rapport technique n° G-2013-69). Lien externe
Groiez, M., Desaulniers, G., Hadjar, A., & Marcotte, O. (2013). Separating Valid Odd-Cycle and Odd-Set Inequalities for the Multiple Depot Vehicle Scheduling Problem. (Rapport technique n° G-2012-83). Lien externe
Groiez, M., Desaulniers, G., Hadjar, A., & Marcotte, O. (2013). Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem. EURO Journal on Computational Optimization, 1(3-4), 283-312. Lien externe
Gutiérrez-Jarpa, G., Desaulniers, G., Laporte, G., & Marianov, V. (2010). A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows. European Journal of Operational Research, 206(2), 341-349. Lien externe
Grønhaug, R., Christiansen, M., Desaulniers, G., & Desrosiers, J. (2010). A branch-and-price method for a liquefied natural gas inventory routing problem. Transportation Science, 44(3), 400-415. Lien externe
Gamache, M., Hébert-Desgroseilliers, L., & Desaulniers, G. (2009). A Generic Linear Program for an Optimal Mine Production Plan. (Rapport technique n° G-2009-83). Lien externe
Gamache, M., Hébert-Desgroseilliers, L., & Desaulniers, G. (novembre 2009). A generic linear program for an optimal mine production plan [Communication écrite]. Mine Planning and Equipment Select & Environmental Issues and Waste Management in Energy and Mineral Product, Banff, Canada. Lien externe
Grønhaug, R., Christiansen, M., Desaulniers, G., & Desrosiers, J. (2008). A Branch-and-Price-and-Cut Method for a Liquefied Natural Gas Inventory Routing Problem. (Rapport technique n° G-2008-49). Lien externe
Gill, S., Desaulniers, G., Hurteau, R., & Ahmadi, M. (mai 2000). Path planning for a polygonal car-like robot in a polygonal environment [Communication écrite]. 31st International Symposium on Robotics (ISR 2000), Montréal, Québec. Non disponible
Hassani, R., Desaulniers, G., & El Hallaoui, I. (2023). A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment. Journal of Scheduling, 18 pages. Lien externe
Hassani, R., Desaulniers, G., & El Hallaoui, I. (2021). Parallel stimulation of disruptions for personnel scheduling in a flexible working environment. (Rapport technique n° G-2021-01). Lien externe
Hassani, R., Desaulniers, G., & El Hallaoui, I. (2021). Real-time bi-objective personnel re-scheduling in the retail industry. European Journal of Operational Research, 293(1), 93-108. Lien externe
Hassani, R., Desaulniers, G., & El Hallaoui, I. (2020). Real-time personnel re-scheduling after a minor disruption in the retail industry. Computers and Operations Research, 120, 14 pages. Lien externe
Hassani, R., Desaulniers, G., & El Hallaoui, I. (2019). Real-time bi-objective personnel re-scheduling in the retail industry. (Rapport technique n° G-2019-55). Lien externe
Hassani, R., Desaulniers, G., & El Hallaoui, I. (2018). Ré-optimisation multi-objectif en temps réel suite à une petite perturbation. (Rapport technique n° G-2018-47). Lien externe
Hassani, R., Desaulniers, G., & El Hallaoui, I. (2017). Real-time personnel re-scheduling after a minor disruption. (Rapport technique n° G-2017-27). Lien externe
Hoang, L. N., Desaulniers, G., Elahipanah, M., & Soumis, F. (2014). Normalizations of employee preferences in personnel scheduling. (Rapport technique n° G-2014-75). Lien externe
Hamdouni, M., Desaulniers, G., & Soumis, F. (2007). Parking Buses in a Depot Using Block Patterns: a Benders Decomposition Approach for Minimizing Type Mismatches. Computers & Operations Research, 34(11), 3362-3379. Lien externe
Hamdouni, M., Soumis, F., & Desaulniers, G. (2007). Parking Buses in a Depot With Stochastic Arrival Times. European Journal of Operational Research, 183(2), 502-515. Lien externe
Hamdouni, M., Soumis, F., & Desaulniers, G. (2006). Parking Buses in a Depot with Stochastic Arrival Times. (Rapport technique n° G-2006-11). Lien externe
Hamdouni, M., Desaulniers, G., Marcotte, O., Soumis, F., & Van Putten, M. (2006). Dispatching Buses in a Depot Using Block Patterns. Transportation Science, 40(3), 364-377. Lien externe
Hamdouni, M., Desaulniers, G., Marcotte, O., Soumis, F., & van Putten, M. (2005). Dispatching Buses in a Depot Using Block Patterns. (Rapport technique n° G-2004-51). Lien externe
Hamdouni, M., Desaulniers, G., & Soumis, F. (2005). Parking Buses in a Depot Using Block Patterns: A Benders Decomposition Approach for Minimizing Type Mismatches. (Rapport technique n° G-2005-70). Lien externe
Haase, K., Desaulniers, G., & Desrosiers, J. (2001). Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems. Transportation Science, 35(3), 286-303. Lien externe
Irnich, S., Desaulniers, G., Desrosiers, J., & Hadjar, A. (2010). Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling. INFORMS Journal on Computing, 22(2), 297-313. Lien externe
Imrnich, S., & Desaulniers, G. (2005). Shortest Path Problems with Resource Constraints. Dans Column Generation (p. 33-65). Lien externe
Jungwirth, A., Desaulniers, G., Frey, M., & Kolisch, R. (2022). Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity. INFORMS Journal on Computing, 34(2), 1157-1175. Lien externe
Jungwirth, A., Desaulniers, G., Frey, M., & Kolisch, R. (2020). Exact branch-price-and-cut for a hospital therapist scheduling problem with flexible service locations and time-dependent location capacity. (Rapport technique n° G-2020-44). Lien externe
Karimi, M., Camiat, F., Desaulniers, G., & Gendreau, M. (2024). An exact branch-and-price-and-cut algorithm for a practical and large-scale dial-a-ride problem. Journal of the Operational Research Society, 1-15. Lien externe
Koza, D. F., Desaulniers, G., & Ropke, S. (2020). Integrated Liner Shipping Network Design and Scheduling. Transportation Science, 54(2), 512-533. Lien externe
Koza, D. F., Desaulniers, G., & Ropke, S. (2017). Integrated liner shipping network design and scheduling. (Rapport technique n° G-2017-100). Lien externe
Karsten, C. V., Brouer, B. D., Desaulniers, G., & Pisinger, D. (2017). Time constrained liner shipping network design. Transportation Research. Part E, Logistics and Transportation Review, 105, 152-162. Lien externe
Lam, E., Desaulniers, G., & Stuckey, P. J. (2022). Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations. Computers & Operations Research, 145, 16 pages. Lien externe
Löffler, M., Desaulniers, G., Irnich, S., & Schneider, M. (2020). Routing electric vehicles with a single recharge per route. Networks, 76(2), 187-205. Lien externe
Lehouillier, T., Nasri, M. I., Soumis, F., Desaulniers, G., & Omer, J. (2017). Solving the Air Conflict Resolution Problem Under Uncertainty Using an Iterative Biobjective Mixed Integer Programming Approach. Transportation Science, 51(4), 1242-1258. Lien externe
Lehouillier, T., Omer, J., Soumis, F., & Desaulniers, G. (2017). Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem. European Journal of Operational Research, 256(3), 696-712. Lien externe
Lasalle Ialongo, D., Desaulniers, G., & Soumis, F. (2015). Airline fleet assignment with stochastic demand and re-fleeting recourse. (Rapport technique n° G-2015-135). Lien externe
Lehouillier, T., Nasri, M. I., Omer, J., Soumis, F., & Desaulniers, G. (2015). Solving the air conflict resolution problem under uncertainty as an iterative bi-objective mixed integer linear program. (Rapport technique n° G-2015-111). Lien externe
Lehouillier, T., Omer, J., Soumis, F., & Desaulniers, G. (2015). Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem. (Rapport technique n° G-2015-103). Lien externe
Lehouillier, T., Omer, J., Soumis, F., & Desaulniers, G. (mai 2015). A new variant of the minimum-weight maximum-cardinality clique problem to solve conflicts between aircraft [Communication écrite]. 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2015), Metz, France. Lien externe
Lasalle Ialongo, D., & Desaulniers, G. (2014). Airline fleet assignment with internal passenger flow reevaluations. EURO Journal on Transportation and Logistics, 3(2), 121-142. Disponible
Lequy, Q., Desaulniers, G., & Solomon, M. M. (2013). Assigning team tasks and multiple activities to fixed work shifts. INFOR, 51(2), 64-75. Lien externe
Lasalle Ialongo, D., & Desaulniers, G. (2012). Airline Fleet Assignment with Internal Passenger Flow Reevaluations. (Rapport technique n° G-2012-40). Lien externe
Lequy, Q., Bouchard, M., Desaulniers, G., Soumis, F., & Tachefine, B. (2012). Assigning multiple activities to work shifts. Journal of Scheduling, 15(2), 239-251. Lien externe
Lequy, Q., Desaulniers, G., & Solomon, M. M. (2012). A two-stage heuristic for multi-activity and task assignment to work shifts. Computers and Industrial Engineering, 63(4), 831-841. Lien externe
Lequy, Q., Desaulniers, G., & Solomon, M. M. (2010). Assigning team tasks and multiple activities to fixed work shifts. (Rapport technique n° G-2010-71). Lien externe
Lequy, Q., Desaulniers, G., & Solomon, M. M. (2010). A Two-Stage Heuristic for Multi-Activity and Task Assignment to Work Shifts. (Rapport technique n° G-2010-28). Lien externe
Lacasse-Guay, È., Desaulniers, G., & Soumis, F. (2010). Aircraft Routing Under Different Business Processes. Journal of Air Transport Management, 16(5), 258-263. Lien externe
Lequy, Q., Bouchard, M., Desaulniers, G., Soumis, F., & Tachefine, B. (2009). Assigning Multiple Activities to Work Shifts. (Rapport technique n° G-2009-86). Lien externe
Lacasse-Guay, È., Desaulniers, G., & Soumis, F. (2009). Aircraft Routing Under Different Business Processes. (Rapport technique n° G-2009-36). Lien externe
Lingaya, N., Cordeau, J.-F., Desaulniers, G., Desrosiers, G., & Soumis, F. (2002). Operational car assigment at VIA Rail Canada. Transportation Research. Part B, Methodological, 36(9), 755-778. Lien externe
Lingaya, N., Cordeau, J.-F., Desaulniers, G., Desrosiers, J., & Soumis, F. (2000). Operational Car Assignment at VIA Rail Canada. (Rapport technique n° G-2000-55). Lien externe
Laurent, J.-C., Desaulniers, G., Malhamé, R. P., & Soumis, F. (1995). Column generation method for optimal load management via control of electric water heaters. IEEE Transactions on Power Systems, 10(3), 1389-1400. Lien externe
Mhamedi, T., Cherkesly, M., & Desaulniers, G. (2024). A branch-price-and-cut algorithm for the multi-commodity two-echelon vehicle routing problem with time windows. (Rapport technique n° G-2024-79). Lien externe
Morabit, M., Desaulniers, G., & Lodi, A. (2023). Learning to repeatedly solve routing problems. Networks, 24 pages. Lien externe
Morabit, M., Desaulniers, G., & Lodi, A. (2023). Machine-Learning–Based Arc Selection for Constrained Shortest Path Problems in Column Generation. INFORMS Journal on Optimization, 5(2), 191-210. Lien externe
Mhamedi, T., Andersson, H., Cherkesly, M., & Desaulniers, G. (2022). A Branch-Price-and-Cut Algorithm for the Two-Echelon Vehicle Routing Problem with Time Windows. Transportation Science, 56(1), 245-264. Lien externe
Morabit, M., Desaulniers, G., & Lodi, A. (2021). Machine-learning-based arc selection for constrained shortest path problems in column generation. (Rapport technique n° G-2021-72). Lien externe
Morabit, M., Desaulniers, G., & Lodi, A. (2021). Machine-Learning-Based Column Selection for Column Generation. Transportation Science, 55(4), 815-831. Lien externe
Mhamedi, T., Andersson, H., Cherkesly, M., & Desaulniers, G. (2020). A branch-price-and-cut algorithm for the two-echelon vehicle routing problem with time windows. (Rapport technique n° G-2020-63). Lien externe
Morabit, M., Desaulniers, G., & Lodi, A. (2020). Machine-learning-based column selection for column generation. (Rapport technique n° G-2020-29). Lien externe
Maher, S. J., Desaulniers, G., & Soumis, F. (2018). The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints. European Journal of Operational Research, 264(2), 534-547. Lien externe
Maher, S., Desaulniers, G., & Soumis, F. (2015). The tail assignment problem with look-ahead maintenance constraints. (Rapport technique n° G-2015-127). Lien externe
Maher, S. J., Desaulniers, G., & Soumis, F. (2014). Recoverable robust single day aircraft maintenance routing problem. Computers and Operations Research, 51, 130-145. Lien externe
Maher, S., Desaulniers, G., & Soumis, F. (2013). Recoverable Robust Single Day Aircraft Maintenance Routing Problem. (Rapport technique n° G-2013-90). Lien externe
Mattos Ribeiro, G., Desaulniers, G., & Desrosiers, J. (2012). A branch-price-and-cut algorithm for the workover rig routing problem. Computers & Operations Research, 39(12), 3305-3315. Lien externe
Nafstad, G. M., Desaulniers, G., & Stålhane, M. (2025). Branch-price-and-cut for the electric vehicle routing problem with heterogeneous recharging technologies and nonlinear recharging functions. Transportation Science, 59(3), 628-646. Disponible
Patel, K. K., Desaulniers, G., & Lodi, A. (2024). An improved column-generation-based matheuristic for learning classification trees. Computers & Operations Research, 165, 106578 (12 pages). Lien externe
Patel, K. K., Desaulniers, G., & Lodi, A. (2023). Revisiting column-generation-based matheuristic for learning classification trees. (Rapport technique n° G-2023-39). Lien externe
Patel, K. K., Desaulniers, G., Lodi, A., & Lécué, F. (2023). Explainable prediction of Qcodes for NOTAMs using column generation. Journal of the Operational Research Society, 11 pages. Lien externe
Perreault-Lafleur, C., Carvalho, M., & Desaulniers, G. (2023). A stochastic integer programming approach to reserve staff scheduling with preferences. International Transactions in Operational Research, 25 pages. Lien externe
Pecin, D., Contardo, C., Desaulniers, G., & Uchoa, E. (2017). New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS Journal on Computing, 29(3), 489-502. Lien externe
Pecin, D., Contardo, C., Desaulniers, G., & Uchoa, E. (2016). New enhancements for the exact solution of the vehicle routing problem with time windows. (Rapport technique n° G-2016-13). Lien externe
Prescott-Gagnon, É., Desaulniers, G., & Rousseau, L.-M. (2014). Heuristics for an oil delivery vehicle routing problem. Flexible Services and Manufacturing Journal, 26(4), 516-539. Lien externe
Prescott-Gagnon, É., Desaulniers, G., & Rousseau, L.-M. (2010). Heuristics for an Oil Delivery Vehicle routing Problem. (Rapport technique n° G-2010-63). Lien externe
Potthoff, D., Huisman, D., & Desaulniers, G. (2010). Column Generation With Dynamic Duty Selection for Railway Crew Rescheduling. Transportation Science, 44(4), 493-505. Lien externe
Prescott-Gagnon, É., Desaulniers, G., Drexl, M., & Rousseau, L.-M. (2010). European Driver Rules in Vehicle Routing With Time Windows. Transportation Science, 44(4), 455-473. Lien externe
Prescott-Gagnon, É., Desaulniers, G., Drexl, M., & Rousseau, L.-M. (2009). European Driver Rules in Vehicle Routing with Time Windows. (Rapport technique n° G-2009-68). Lien externe
Prescott-Gagnon, E., Desaulniers, G., & Rousseau, L.-M. (mai 2007). A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows [Communication écrite]. Recent Advances in Vehicle Routing Optimization (ROUTE 2007), Jekyll Island, GA. Publié dans Networks, 54(4). Lien externe
Pepin, A.-S., Desaulniers, G., Hertz, A., & Huisman, D. (2009). A comparison of five heuristics for the multiple depot vehicle scheduling problem. Journal of Scheduling, 12(1), 17-30. Lien externe
Potthoff, D., Huisman, D., & Desaulniers, G. (2008). Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling. (Rapport technique n° G-2008-87). Lien externe
Prescott-Gagnon, É., Desaulniers, G., & Rousseau, L.-M. (2007). A Branch-and-Price-Based Large Neighborhood Search Algorithm for the Vehicle Routing Problem with Time Windows. (Rapport technique n° G-2007-67). Lien externe
Prescott-Gagnon, É., Desaulniers, G., & Rousseau, L.-M. (juin 2007). A large neighbourhood algorithm for the vehicle routing problem with time windows [Communication écrite]. 7th Metaheuristic International Conference (MIC 2007), Montréal, Québec. Non disponible
Pepin, A.-S., Desaulniers, G., Hertz, A., & Huisman, D. (2006). Comparison of Heuristic Approaches for the Multiple Depot Vehicle Scheduling Problem. (Rapport technique n° G-2006-65). Lien externe
Paquet, M., Martel, A., & Desaulniers, G. (2004). Including technology selection decisions in manufacturing network design models. International Journal of Computer Integrated Manufacturing, 17(2), 117-125. Lien externe
Paquet, M., Martel, A., & Desaulniers, G. (janvier 2001). Including technology selection decisions in manufacturing design models [Communication écrite]. International Conference on Industrial Engineering and Production Management, Québec, Canada. Non disponible
Quesnel, F., Wu, A., Desaulniers, G., & Soumis, F. (2022). Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering. Computers and Operations Research, 138, 15 pages. Lien externe
Quesnel, F., Wu, A., Desaulniers, G., & Soumis, F. (2020). Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering. (Rapport technique n° G-2020-72). Lien externe
Quesnel, F., Desaulniers, G., & Soumis, F. (2020). A branch-and-price heuristic for the crew pairing problem with language constraints. European Journal of Operational Research, 283(3), 1040-1054. Lien externe
Quesnel, F., Desaulniers, G., & Soumis, F. (2020). Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem. Transportation Science, 54(1), 97-114. Lien externe
Quesnel, F., Desaulniers, G., & Soumis, F. (2019). The airline crew pairing problem with language constraints. (Rapport technique n° G-2019-25). Lien externe
Quesnel, F., Desaulniers, G., & Soumis, F. (2017). A new heuristic branching scheme for the crew pairing problem with base constraints. Computers & Operations Research, 80, 159-172. Lien externe
Quesnel, F., Desaulniers, G., & Soumis, F. (2016). A new heuristic branching scheme for the crew pairing problem with base constraints. (Rapport technique n° G-2016-47). Lien externe
Rastgar Amini, F., Contardo, C., Desaulniers, G., & Gasse, M. (2025). Learning to enumerate shifts for large-scale flexible personnel scheduling problems. Journal of Scheduling, 19 pages. Lien externe
Rastgar-Amini, F., Aloise, D., Contardo, C., & Desaulniers, G. (2024). Data Mining-Driven Shift Enumeration for Accelerating the Solution of Large-Scale Personnel Scheduling Problems. ACM Transactions on Evolutionary Learning and Optimization, 24 pages. Lien externe
Ricard, L., Desaulniers, G., Lodi, A., & Rousseau, L.-M. (2024). Increasing schedule reliability in the multiple depot vehicle scheduling problem with stochastic travel time. Omega-International Journal of Management Science, 127, 103100 (19 pages). Disponible
Rastgar-Amini, F., Aloise, D., Contardo, C., & Desaulniers, G. (2023). Data mining-driven shift enumeration for acceleratiing the solution of large-scale personnel scheduling problems. (Rapport technique n° G-2023-61). Lien externe
Rastgar Amini, F., Contardo, C., Desaulniers, G., & Gasse, M. (2022). Learning to enumerate shifts for large-scale flexible personnel scheduling problems. (Rapport technique n° G-2022-29). Lien externe
Ricard, L., Desaulniers, G., Lodi, A., & Rousseau, L.-M. (2022). Increasing schedule reliability in the multi-depot vehicle scheduling problem with stochastic travel time. (Rapport technique n° 2022-30). Lien externe
Ricard, L., Desaulniers, G., Lodi, A., & Rousseau, L.-M. (2022). Predicting the probability distribution of bus travel time to measure the reliability of public transport services. Transportation Research Part C-Emerging Technologies, 138, 103619 (16 pages). Lien externe
Rostami, B., Desaulniers, G., Errico, F., & Lodi, A. (2021). Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times. Operations Research, 69(2), 436-455. Lien externe
Rodriguez, J. A., Anjos, M. F., Côté, P., & Desaulniers, G. (2020). Accelerating Benders decomposition for short-term hydropower maintenance scheduling. European Journal of Operational Research, 289(1), 240-253. Lien externe
Rostami, B., Desaulniers, G., Errico, F., & Lodi, A. (2018). A PCA-based approximation scheme for combinatorial optimization with uncertain and correlated data. (Rapport technique n° G-2018-61). Lien externe
Rodríguez Sarasty, J. A., Anjos, M. F., Côté, P., & Desaulniers, G. (2018). Stochastic hydropower generator maintenance scheduling via Benders decomposition. (Rapport technique n° G-2018-32). Lien externe
Rodriguez Sarasty, J. A., Anjos, M. F., Cote, P., & Desaulniers, G. (2018). MILP Formulations for Generator Maintenance Scheduling in Hydropower Systems. IEEE Transactions on Power Systems, 33(6), 6171-6180. Lien externe
Rostami, B., Desaulniers, G., Errico, F., & Lodi, A. (2018). The vehicle routing problem with stochastic and correlated travel times. (Rapport technique n° DS4DM-2018-001). Lien externe
Rostami, B., Desaulniers, G., Errico, F., & Lodi, A. (2017). The vehicle routing problem with stochastic and correlated travel times. (Rapport technique n° G-2017-109). Lien externe
Rodríguez Sarasty, J. A., Anjos, M. F., Côté, P., & Desaulniers, G. (2017). MILP formulations for generator maintenance scheduling in hydropower systems. (Rapport technique n° G-2017-63). Lien externe
Rekik, M., Desaulniers, G., Saddoune, M., & El Hallaoui, I. (2017). An exact solution approach for bid construction in truckload transportation procurement auctions with side constraints. (Rapport technique n° G-2017-51). Lien externe
Rakke, J. G., Andersson, H., Christiansen, M., & Desaulniers, G. (2015). A new formulation based on customer delivery patterns for a maritime inventory routing problem. Transportation Science, 49(2), 384-401. Lien externe
Ribeiro, G. M., Desaulniers, G., Desrosiers, J., Vidal, T., & Vieira, B. S. (2014). Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon. Journal of Heuristics, 20(6), 677-708. Lien externe
Ribeiro, G. M., Desaulniers, G., Desrosiers, J., Vidal, T., & Vieira, B. S. (2013). Efficient Heuristics for the Workover Rig Routing Problem with a Heterogeneous Fleet and a Finite Horizon. (Rapport technique n° G-2013-47). Lien externe
Rakke, J. G., & Desaulniers, G. (juin 2013). Routing and scheduling for deployment of vessels for one of the worlds leading RoRo carriers [Communication écrite]. 8th Triennal Symposium on Transportation Analysis (Tristan VIII), San Pedro de Atacama, Chile (5 pages). Lien externe
Rakke, J. G., Andersson, H., Christiansen, M., & Desaulniers, G. (2012). Branch-Price-and-Cut for Creating an Annual Delivery Program of Multi-Product Liquefied Natural Gas. (Rapport technique n° G-2012-17). Lien externe
Ribeiro, G. M., Desaulniers, G., & Desrosiers, J. (2011). A Branch-Price-and-Cut Algorithm for the Workover Rig Routing Problem. (Rapport technique n° G-2011-81). Lien externe
Rakke, J. G., Andersson, H., Christiansen, M., & Desaulniers, G. (juin 2010). Branch-and-Price for creating an Annual Delivery Program of Multi-Product Liquefied Natural Gas [Communication écrite]. 7th Triennal Symposium on Transportation Analysis (Tristan VII), Tromsø, Norway. Lien externe
Rouillon, S., Desaulniers, G., & Soumis, F. (2006). An Extended Branch-and-Bound Method for Locomotive Assignment. Transportation Research. Part B, Methodological, 40(5), 404-423. Lien externe
Rouillon, S., Desaulniers, G., & Soumis, F. (2003). An Extended Branch-and-Bound Method for Locomotive Assignment. (Rapport technique n° G-2003-31). Lien externe
Sabatier Montanaro, Y., Jacquet, T. J., Cappart, Q., & Desaulniers, G. (novembre 2025). A Column Generation Heuristic for Multi-depot Electric Bus Scheduling [Communication écrite]. 22nd International Conference on integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2025), Melbourne, VIC, Australia. Publié dans Lecture notes in computer science. Lien externe
Skålnes, J., Andersson, H., Desaulniers, G., & Stålhane, M. (2022). An improved formulation for the inventory routing problem with time-varying demands. European Journal of Operational Research, 302(3), 1189-1201. Lien externe
Spliet, R., & Desaulniers, G. (2015). The discrete time window assignment vehicle routing problem. European Journal of Operational Research, 244(2), 379-391. Lien externe
Saddoune, M., Desaulniers, G., & Soumis, F. (2013). Aircrew pairings with possible repetitions of the same flight number. Computers & Operations Research, 40(3), 805-814. Lien externe
Spliet, R., & Desaulniers, G. (2012). The Discrete Time Window Assignment Vehicle Routing Problem. (Rapport technique n° G-2012-81). Lien externe
Stålhane, M., Andersson, H., Christiansen, M., Cordeau, J.-F., & Desaulniers, G. (2012). A branch-price-and-cut method for a ship routing and scheduling problem with split loads. Computers & Operations Research, 39(12), 3361-3375. Lien externe
Saddoune, M., Desaulniers, G., El Hallaoui, I., & Soumis, F. (2012). Integrated airline crew pairing and crew assignment by dynamic constraint aggregation. Transportation Science, 46(1), 39-55. Lien externe
Stålhane, M., Andersson, H., Christiansen, M., Cordeau, J.-F., & Desaulniers, G. (2011). A Branch-Price-and-Cut Method for a Ship Routing and Scheduling Problem with Split Loads. (Rapport technique n° G-2011-57). Lien externe
Saddoune, M., Desaulniers, G., El Hallaoui, I., & Soumis, F. (2011). Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods. European Journal of Operational Research, 212(3), 445-454. Lien externe
Saddoune, M., Desaulniers, G., El Hallaoui, I., & Soumis, F. (2010). Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation. (Rapport technique n° G-2010-05). Lien externe
Spoorendonk, S., & Desaulniers, G. (2010). Clique Inequalities Applied to the Vehicle Routing Problem With Time Windows. INFOR, 48(1), 53-67. Lien externe
Soumis, F., Saddoune, M., El Hallaoui, I., & Desaulniers, G. (juin 2010). Integrated Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation [Communication écrite]. 7th Triennial Symposium on Transportation Analysis (TRISTAN 2010), Tromsø, Norway. Lien externe
Saddoune, M., Desaulniers, G., & Soumis, F. (2009). Aircrew Pairings with Possible Repetitions of the Same Flight Number. (Rapport technique n° G-2009-76). Lien externe
Saddoune, M., Desaulniers, G., & Soumis, F. (juillet 2009). A rolling horizon solution approach for the airline crew pairing problem [Communication écrite]. International Conference on Computers & Industrial Engineering, Troyes, France. Lien externe
Soumis, F., Saddoune, M., El Hallaoui, I., & Desaulniers, G. (août 2009). Simultaneous optimization of crew pairing and rostering [Communication écrite]. AGIFORS 2009, Las Vegas, USA. Non disponible
Spoorendonk, S., & Desaulniers, G. (2008). Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows. (Rapport technique n° G-2008-72). Lien externe
Tahir, A., Desaulniers, G., & El Hallaoui, I. (2022). Integral column generation for set partitioning problems with side constraints. INFORMS Journal on Computing, 34(4), 2313-2331. Lien externe
Tahir, A., Quesnel, F., Desaulniers, G., El Hallaoui, I., & Yaakoubi, Y. (2021). An Improved Integral Column Generation Algorithm Using Machine Learning for Aircrew Pairing. Transportation Science, 55(6), 1411-1429. Lien externe
Tahir, A., Quesnel, F., Desaulniers, G., El Hallaoui, I., & Yaakoubi, Y. (2020). An improved integral column generation algorithm using machine learning for aircrew pairing. (Rapport technique n° G-2020-71). Lien externe
Tahir, A., Desaulniers, G., & El Hallaoui, I. (2019). Integral column generation for set partitioning problems with side constraints. (Rapport technique n° G-2019-85). Lien externe
Tahir, A., Desaulniers, G., & El Hallaoui, I. (2019). Integral column generation for the set partitioning problem. EURO Journal on Transportation and Logistics, 8(5), 713-744. Lien externe
Tahir, A., Desaulniers, G., & El Hallaoui, I. (2017). Integral column generation. (Rapport technique n° G-2017-53). Lien externe
Vendé, P., Desaulniers, G., Kergosien, Y., & Mendoza, J. E. (2023). Matheuristics for a multi-day electric bus assignment and overnight recharge scheduling problem. Transportation Research Part C: Emerging Technologies, 156, 104360 (21 pages). Lien externe
van Zon, M., & Desaulniers, G. (2021). The joint network vehicle routing game with optional customers. Computers and Operations Research, 133, 16 pages. Lien externe
van Zon, M., & Desaulniers, G. (2020). The joint network vehicle routing game with optional customers. (Rapport technique n° G-2020-70). Lien externe
Veenstra, M., Cherkesly, M., Desaulniers, G., & Laporte, G. (2017). The pickup and delivery problem with time windows and handling operations. Computers & Operations Research, 77, 127-140. Lien externe
Villeneuve, D., & Desaulniers, G. (2005). The shortest path problem with forbidden paths. European Journal of Operational Research, 165(1), 97-107. Lien externe
Yamín, D., Desaulniers, G., & Mendoza, J. E. (2024). Code and Data Repository for The Electric Vehicle Routing and Overnight Charging Scheduling Problem on a Multigraph [Ensemble de données]. Lien externe
Yamín, D., Desaulniers, G., & Mendoza, J. E. (2024). The Electric Vehicle Routing and Overnight Charging Scheduling Problem on a Multigraph. Informs Journal on Computing, 0404 (23 pages). Lien externe
Yarkony, J., Adulyasak, Y., Singh, M., & Desaulniers, G. (2020). Data Association via Set Packing for Computer Vision Applications. INFORMS Journal on Optimization, 2(3), 145-228. Lien externe
