![]() | Monter d'un niveau |
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
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., & Lecue, F. (2023). Explainable prediction of Qcodes for NOTAMs using column generation. Journal of the Operational Research Society, 11 pages. 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
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
Vende, 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
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
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
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
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
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
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
Skalnes, J., Andersson, H., Desaulniers, G., & Stalhane, 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
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
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
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
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
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
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
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
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
van Zon, M., & Desaulniers, G. (2021). The joint network vehicle routing game with optional customers. Computers and Operations Research, 133, 16 pages. 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
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
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
Costa, L., 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
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
Rodriguez, J. A., Anjos, M. F., Cote, P., & Desaulniers, G. (2020). Accelerating Benders decomposition for short-term hydropower maintenance scheduling. European Journal of Operational Research, 289(1), 240-253. 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
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
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
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
Koza, D. F., Desaulniers, G., & Ropke, S. (2020). Integrated Liner Shipping Network Design and Scheduling. Transportation Science, 54(2), 512-533. 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
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
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
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
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
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
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
Burgy, 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
Costa, L., Contardo, C., & Desaulniers, G. (2019). Exact Branch-Price-and-Cut Algorithms for Vehicle Routing. Transportation Science, 53(4), 946-985. 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
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. 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
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
Desfontaines, L., & Desaulniers, G. (2018). Multiple depot vehicle scheduling with controlled trip shifting. Transportation Research Part B: Methodological, 113, 34-53. 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. Lien externe
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
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
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. 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
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
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
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
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
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
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
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
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
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
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
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
De La Poix De Freminville, 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
Spliet, R., & Desaulniers, G. (2015). The discrete time window assignment vehicle routing problem. European Journal of Operational Research, 244(2), 379-391. 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
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
Lasalle Ialongo, D., & Desaulniers, G. (2014). Airline fleet assignment with internal passenger flow reevaluations. EURO Journal on Transportation and Logistics, 3(2), 121-142. 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
Benavent, E., Corberan, A., 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
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
Prescott-Gagnon, E., 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
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
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
Groiez, M., Desaulniers, G., & Marcotte, O. (2014). Valid inequalities and separation algorithms for the set partitioning problem. INFOR, 52(4), 185-196. 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
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
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
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
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
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
Stalhane, 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
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
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
Desaulniers, G., Desrosiers, J., & Spoorendonk, S. (2011). Cutting planes for branch-and-price algorithms. Networks, 58(4), 301-310. 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
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
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
Lacasse-Guay, E., Desaulniers, G., & Soumis, F. (2010). Aircraft Routing Under Different Business Processes. Journal of Air Transport Management, 16(5), 258-263. 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
Gutierrez-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
Grnhaug, 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
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
Spoorendonk, S., & Desaulniers, G. (2010). Clique Inequalities Applied to the Vehicle Routing Problem With Time Windows. INFOR, 48(1), 53-67. 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, E., 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
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
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
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
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
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
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
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
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
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., 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
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
Belanger, 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
Belanger, 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
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
Villeneuve, D., & Desaulniers, G. (2005). The shortest path problem with forbidden paths. European Journal of Operational Research, 165(1), 97-107. 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
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
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
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
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
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., 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., 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. (1996). On shortest paths for a car-like robot maneuvering around obstacles. Robotics and Autonomous Systems, 17(3), 139-148. 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
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
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
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
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). Non disponible
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
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
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
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
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
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
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, San Pedro de Atacama, Chile. Lien externe
Soumis, F., Saddoune, M., El Hallaoui, I., & Desaulniers, G. (juin 2010). Crew pairing and assignment porblem solved with dynamic constraint aggregation [Communication écrite]. 7th Triennial Symposium on Transportation Analysis (TRISTAN 2010), Tromso, Norway. Non disponible
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
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
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
Prescott-Gagnon, E., 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
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
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
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
Desaulniers, G., Desrosiers, J., Lasry, A., & Solomon, M. M. Crew Pairing for a Regional Carrier [Communication écrite]. Computer-Aided Transit Scheduling. 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
Desaulniers, G., Desrosiers, J., & Solomon, M. M. (2005). Column Generation. 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
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., & Hickman, M. (2007). Public transit. Dans Handbooks Operations Research and Management Science (Vol. 14, p. 69-127). Lien externe
Imrnich, S., & Desaulniers, G. (2005). Shortest Path Problems with Resource Constraints. Dans Column Generation (p. 33-65). 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., 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
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
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., 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