DESROSIERS, J., LÜBBECKE, M., DESAULNIERS, G., GAUTHIER, J.B., Branch-and-price, Springer, Cham, 2026.

ANKEM, V.A., DESAULNIERS, G., GAMACHE, M., RAYMOND, V. New cutting planes for open-pit mine scheduling with multi-period block extraction Computers and Operations Research 189, 107408, 2026.

RASTGAR-AMINI, F., ALOISE, D., CONTARDO, C., DESAULNIERS, G. Data mining-driven shift enumeration for accelerating the solution of large-scale personnel scheduling problems. ACM Transactions on Evolutionary Learning and Optimization 5(4), 1-24, 2025.

SABATIER MONTANARO, Y., JACQUET, T., CAPPART, Q., DESAULNIERS, G. A column generation heuristic for multi-depot electric bus scheduling. Proceedings of the 22nd International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR), Melbourne, Australia, November 10-13, 2025, Part II, pp. 103-118.

YAMIN, D., DESAULNIERS, G., MENDOZA, J.E. The electric vehicle routing and overnight charging scheduling problem on a multigraph. INFORMS Journal on Computing 37(4), 808-830, 2025.

RASTGAR-AMINI, F., CONTARDO, C., DESAULNIERS, G., GASSE, M. Learning to enumerate shifts for large-scale flexible personnel scheduling problems. Journal of Scheduling 28(4), 425-443, 2025.

NAFSTAD, G.M., DESAULNIERS, G., STÅLHANE, M. Branch-price-and-cut for the electric vehicle routing problem with heterogeneous recharging technologies and nonlinear recharging functions. Transportation Science 59(3), 628-646, 2025

KARIMI, M., CAMIAT, F., DESAULNIERS, G., GENDREAU, M. An exact branch-price-and-cut algorithm for a practical and large scale dial-a-ride problem. Journal of the Operational Research Society 76(6), 1125-1139, 2025.

GERBAUX, J., DESAULNIERS, G., CAPPART, Q. A machine-learning-based column generation heuristic for electric bus scheduling. Computers and Operations Research 173, 106848, 2025.

PERREAULT-LAFLEUR, C., CARVALHO, M., DESAULNIERS, G. A stochastic integer programming approach to reserve staff scheduling with preferences. International Transactions in Operational Research 32(1), 289-313, 2025.

AZÉMA, M., DESAULNIERS, G., MENDOZA, J.E., PESANT, G. A constraint programming model for the electric bus assignment problem with parking constraints. Proceedings of the 21st International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR), Uppsala, Sweden, May 28-31, 2024, Part I, pp. 17-33.

RICARD, L., DESAULNIERS, G., LODI, A., ROUSSEAU, L.-M. Increasing schedule reliability in the multi-depot vehicle scheduling problem with stochastic travel time. Omega 127(1), 103100, 2024.

HASSANI, R., DESAULNIERS, G., ELHALLAOUI, I. A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment. Journal of Scheduling 27(2), 165-182, 2024.

MORABIT, M., DESAULNIERS, G., LODI, A. Learning to repeatedly solve routing problems. Networks 83(3), 503-526, 2024.

PATEL, K.K., DESAULNIERS, G., LODI, A., LECUE, F. Explainable prediction of Qcodes for NOTAMs using column generation. Journal of the Operational Research Society 75(1), 173-183, 2024.

PATEL, K.K., DESAULNIERS, G., LODI, A. An improved column-generation-based matheuristic for learning classification trees. Computers and Operations Research 165, 106579, 2024.

VENDÉ, P., DESAULNIERS, G., KERGOSIEN, Y., MENDOZA, J.E. Matheuristics for a multi-day electric bus assignment and overnight recharge scheduling problem. Transportation Research Part C 156, 104360, 2023.

MORABIT, M., DESAULNIERS, G., LODI, A. Machine-learning-based arc selection for constrained shortest path problems in column generation. INFORMS Journal on Optimization 5(2), 191-210, 2023.

ALTMAN, C., DESAULNIERS, G., ERRICO, F. The fragility-constrained vehicle routing problem with time windows. Transportation Science 57(2), 552-572, 2023.

TAHIR, A., DESAULNIERS, G., ELHALLAOUI, I. Integral column generation for set partitioning problems with side constraints. INFORMS Journal on Computing 34(4), 2313-2331, 2022

SKÅLNES, J., ANDERSSON, H., DESAULNIERS, G., STÅLHANE, M. An improved formulation for the inventory routing problem with time-varying demands. European Journal of Operational Research 302(3), 1189-1201, 2022.

LAM, E., DESAULNIERS, G., STUCKEY, P.J. Branch-and-cut-and-price for electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations. Computers and Operations Research 145, 105870, 2022.

JUNGWIRTH, A., DESAULNIERS, G., FREY, M., KOLISCH, R. 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), 1141-1156, 2022.

COSTA, L., CONTARDO, C., DESAULNIERS, G., YARKONY, J. Stabilized column generation via the dynamic separation of aggregated rows. INFORMS Journal on Computing 34(2), 1157-1175, 2022.

RICARD, L., DESAULNIERS, G., LODI, A., ROUSSEAU, L.-M. Predicting the probability distribution of bus travel time to measure the reliability of public transport services. Transportation Research Part C 138, 103619, 2022.

MHAMEDI, T., ANDERSSON, M., CHERKESLY, M., DESAULNIERS, G. A branch-price-and-cut algorithm for the two-echelon vehicle routing problem with time windows. Transportation Science 56(1), 245-264, 2022.

QUESNEL, F., WU, A., DESAULNIERS, G., SOUMIS, F. Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering. Computers and Operations Research 138, 105554, 2022.

TAHIR, A., QUESNEL, F., DESAULNIERS, G., EL HALLAOUI, I., YAAKOUBI, Y. An improved integral column generation algorithm using machine learning for aircrew pairing. Transportation Science 55(6), 1411-1429, 2021.

ER-RBIB, S., DESAULNIERS, G., EL HALLAOUI, I., MUNROE, P. Preference-based and cyclic bus driver rostering problem with fixed days off. Public Transport 13(2), 251-286, 2021.

MORABIT, M., DESAULNIERS, G., LODI, A. Machine-learning-based column selection for column generation. Transportation Science 55(4), 815-831, 2021

VAN ZON, M., DESAULNIERS, G. The joint network vehicle routing game with optional customers. Computers and Operations Research 133, 105375, 2021

DALMEIJER, K., DESAULNIERS, G. Addressing orientation-symmetry in the time window assignment vehicle routing problem. INFORMS Journal on Computing 33(2), 495-510, 2021.

ER-RBIB, S., BANI, A., DESAULNIERS, G., EL HALLAOUI, I. Integrated and sequential solution methods for the cyclic bus driver rostering problem. Journal of the Operational Research Society 72(4), 764-779, 2021.

COSTA, L., CONTARDO, C., DESAULNIERS, G., PECIN, D. Selective arc-ng pricing for vehicle routing. International Transactions in Operational Research 28(5), 2633-2690, 2021.

ROSTAMI, B., DESAULNIERS, G., ERRICO, F., LODI, A. Branch-price-and-cut algorithms for the vehicle routing problem with stochastic and correlated travel times. Operations Research 69(2), 436-455, 2021.

HASSANI, R., DESAULNIERS, G., ELHALLAOUI, I. Real-time bi-objective personnel re-scheduling in the retail industry. European Journal of Operational Research 293(1), 93-108, 2021

BRETIN, A., DESAULNIERS, G., ROUSSEAU, L.-M. The traveling salesman problem with time windows in postal services. Journal of the Operational Research Society 72(2), 383-397, 2021.

BALLER, A.C., DABIA, S., DESAULNIERS, G., DULLAERT, W.E.H. The inventory routing problem with demand moves. SN Operations Research Forum 2, 6, 2021.

RODRIGUEZ, J., ANJOS, M., CÔTÉ, P., DESAULNIERS, G. Accelerating Benders decomposition for short-term hydropower maintenance scheduling. European Journal of Operational Research 289(1), 240-253, 2021.

DESAULNIERS, G., GSCHWIND, T., IRNICH, S. Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models. Transportation Science 54(5), 1170-1188, 2020.

DESAULNIERS, G., LESSARD, F., SADDOUNE, M., SOUMIS, F. Dynamic constraint aggregation for solving very large-scale airline crew pairing problems. SN Operations Research Forum 1, 19, 2020.

YARKONY, J., ADULYASAK, Y., SINGH, M., DESAULNIERS, G. Data association via set packing for computer vision applications. INFORMS Journal on Optimization 2(3), 167-191, 2020.

LÖFFLER, M., DESAULNIERS, G., IRNICH, S., SCHNEIDER, M. Routing electric vehicles with a single recharge per route. Networks 76(2), 187-205, 2020.

HASSANI, R., DESAULNIERS, G., ELHALLAOUI, I. Real-time personnel re-scheduling after a minor disruption in the retail industry. Computers and Operations Research 120, 104952, 2020.

KOZA, D.F., DESAULNIERS, G., ROPKE, S. Integrated liner shipping network design and scheduling. Transportation Science 54(2), 512-533, 2020.

QUESNEL, F., DESAULNIERS, G., SOUMIS, F. Improving air crew rostering by considering crew preferences in the crew pairing problem. Transportation Science 54(1), 97-114, 2020.

QUESNEL, F., DESAULNIERS, G., SOUMIS, F. A branch-and-price heuristic for the crew pairing problem with language constraints. European Journal of Operational Research 283(3), 1040-1054, 2020.

DAHMEN, S., REKIK, M., SOUMIS, F., DESAULNIERS, G. A two-stage solution approach for personalized multi-department multi-day shift scheduling. European Journal of Operational Research 280(3), 1051-1063, 2020.

TAHIR, A., DESAULNIERS, G., ELHALLAOUI, I. Integral column generation. EURO Journal on Transportation and Logistics 8(5), 713-744, 2019.

ATTIA, D., BÜRGY, R., DESAULNIERS, G., SOUMIS, F. A decomposition-based heuristic for large employee scheduling problems with inter-departement transfers. EURO Journal on Computational Optimization 7(4), 325-357, 2019.

BÜRGY, R., MICHON-LACAZE, H., DESAULNIERS, G. Employee scheduling with short demand perturbations and extensible shifts. Omega 89(1), 177-192, 2019.

COSTA, L., CONTARDO, C., DESAULNIERS, G. Exact branch-price-and-cut algorithms for vehicle routing. Transportation Science 53(4), 946-985, 2019.

DAYARIAN, I., DESAULNIERS, G. A branch-price-and-cut algorithm for a production-routing problem with short-lifespan products. Transportation Science 53(3), 829-849, 2019.

DESAULNIERS, G., PECIN, D., CONTARDO, C. Selective pricing in branch-price-and-cut algorithms for vehicle routing. EURO Journal on Transportation and Logistics 8(2), 147-168, 2019.

BAGGER, N.C.F., DESAULNIERS, G., DESROSIERS, J. Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem. Journal of Scheduling 22(2), 155-172, 2019.

FINK, M., DESAULNIERS, G., FREY, M., KIERMAIER, F., KOLISCH, R., SOUMIS, F. Column generation for vehicle routing problems with multiple synchronization constraints. European Journal of Operational Research 272(2), 699-711, 2019.

RODRIGUEZ, J., ANJOS, M., CÔTÉ, P., DESAULNIERS, G. MILP formulations for generator maintenance scheduling in hydropower systems. IEEE Transactions on Power Systems 33(6), 6171-6180, 2018.

ERRICO, F., DESAULNIERS, G., GENDREAU, M., REI, W., ROUSSEAU, L.-M. The vehicle routing problem with hard time windows and stochastic service times. EURO Journal on Transportation and Logistics 7(3), 223-251, 2018.

DESFONTAINES, L., DESAULNIERS, G. Multiple depot vehicle scheduling problem with controlled trip shifting. Transportation Research Part B 113(1), 34-53, 2018.

MAHER, S., DESAULNIERS, G., SOUMIS, F. The daily tail assignment problem under uncertainty using look-ahead maintenance constraints. European Journal of Operational Research 264(2), 534-547, 2018.

LEHOUILLIER, T., NASRI, M.I., OMER, J., SOUMIS, F., DESAULNIERS, G. Solving the air conflict resolution problem under uncertainty using an iterative bi-objective mixed integer programming approach. Transportation Science 51(4), 1226-1241, 2017.

ARCHETTI, C., DESAULNIERS, G., SPERANZA, M.G. Minimizing the logistic ratio in the inventory routing problem. EURO Journal on Transportation and Logistics 6(4), 289-306, 2017.

BOUARAB, H., DESAULNIERS, G., DESROSIERS, J., GAUTHIER, J.-B. Linear fractional approximations for master problems in column generation. Operations Research Letters 45(5), 503-507, 2017.

KARSTEN, C.V., BROUER, B.D., DESAULNIERS, G., PISINGER, D. Time constrained liner shipping network design. Transportation Research Part E 105(1), 152-162, 2017.

PECIN, D., CONTARDO, C., DESAULNIERS, G., UCHOA, E. New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS Journal on Computing 29(3), 489-502, 2017.

ANDERSSON, H., CHRISTIANSEN, M., DESAULNIERS, G., RAKKE, J.G. Creating annual delivery programs of liquefied natural gas. Optimization and Engineering 18(1), 299-316, 2017.

QUESNEL, F., DESAULNIERS, G., SOUMIS, F. A new heuristic branching scheme for the crew pairing problem with base constraints. Computers and Operations Research 80(1), 159-172, 2017.

LEHOUILLIER, T., OMER, J., SOUMIS, F., DESAULNIERS, G. 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, 2017.

VEENSTRA, M., CHERKESLY, M., DESAULNIERS, G., LAPORTE, G. The pickup and delivery problem with time windows and handling operations. Computers and Operations Research 77(1), 127-140, 2017.

DESAULNIERS, G., ERRICO, F., IRNICH, S., SCHNEIDER, M. Exact algorithms for electric vehicle-routing problems with time windows. Operations Research 64(6), 1388-1405, 2016.

DESAULNIERS, G., RAKKE, J.G., COELHO, L.C. A branch-price-and-cut algorithm for the inventory-routing problem. Transportation Science 50(3), 1060-1076, 2016.

ANDERSSON, H., CHRISTIANSEN, M., DESAULNIERS, G. A new decomposition algorithm for a liquified natural gas inventory routing problem. International Journal of Production Research 54(2), 564-578, 2016.

CHERKESLY, M., DESAULNIERS, G., IRNICH, S., LAPORTE, G. 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, 2016.

ERRICO, F., DESAULNIERS, G., GENDREAU, M., REI, W., ROUSSEAU, L.-M. 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, 2016.

CHERKESLY, M., DESAULNIERS, G., LAPORTE, G. Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and LIFO loading. Transportation Science 49(4), 752-766 (2015).

BROUER, B.D., DESAULNIERS, G., KARSTEN, C.V., PISINGER, D. A matheuristic for the liner shipping network design problem with tranist time restrictions. Proceedings of the 6th International Conference on Computational Logisitics, Delft, Netherlands, September 23-25, 2015, pp. 195-208.

CHERKESLY, M., DESAULNIERS, G., LAPORTE, G. A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Computers and Operations Research 62, 23-35 (2015).

LEHOUILLIER, T., OMER, J., SOUMIS, F., DESAULNIERS, G. A new variant of the minimum-weight maximum-cardinality clique problem to solve conflicts between aircraft. Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, Metz, France, May 11-13, 2015, Part I, pp. 3-14.

RAKKE, J.G., ANDERSSON, H., CHRISTIANSEN, M., DESAULNIERS, G. A new formulation based on customer delivery patterns for a maritime inventory problem. Transportation Science, 49(2), 384-401 (2015).

DE FRÉMINVILLE, P., DESAULNIERS, G., ROUSSEAU, L.-M., PERRON, S. A column generation heuristic for districting the price of a financial product. Journal of the Operational Research Society. 66(6), 965-978 (2015).

SPLIET, R., DESAULNIERS, G. The discrete time window assignment vehice routing problem. European Journal of Operational Research 244(2), 379-391 (2015).

CONTARDO, C., DESAULNIERS, G., LESSARD, F. Reaching the elementary lower bound in the vehicle routing problem with time windows. Networks 65(1), 88-99 (2015).

GROIEZ, M., DESAULNIERS, G., MARCOTTE, O. Valid inequalities and separation algorithms for the set partitioning problem. INFOR 52(4), 185-196 (2014).

BROUER, B.D., DESAULNIERS, G., PISINGER, D. A matheuristic for a liner shipping network design problem. Transportation Research Part E 72(1), 42-59 (2014).

RIBEIRO, G.M., DESAULNIERS, G., DESROSIERS, J., VIDAL, T., VIEIRA, B.S. Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon. Journal of Heuristics 20(6), 677-708 (2014).

DESAULNIERS, G., MADSEN, O.B.G., ROPKE, S. The vehicle routing problem with time windows. In P. Toth and D. Vigo (eds.), Vehicle routing: Problems, methods, and applications, second edition, MOS-SIAM Series on Optimization, SIAM, Philadelphia, 119-159 (2014).

PRESCOTT-GAGNON, E., DESAULNIERS, G., ROUSSEAU, L.-M. Heuristics for an oil delivery vehicle routing problem. Flexible Services and Manufacturing Journal. 26(4), 516-539 (2014).

LASALLE IALONGO, D., DESAULNIERS, G. Airline fleet assignment with internal passenger flow reevaluations. EURO Journal on Transportation and Logistics 3(2), 121-142 (2014).

MAHER, S., DESAULNIERS, G., SOUMIS, F. Recoverable robust single day aircraft maintenance routing problem. Computers and Operations Research 51, 130-145 (2014).

GAUVIN, C., DESAULNIERS, G., GENDREAU, M. A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. Computers and Operations Research. 50, 141-153 (2014).

BENAVENT, E., CORBERAN, A., DESAULNIERS, G., LESSARD, F., PLANA, I., SANCHIS, J.M. A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem. Networks 63(1), 34-45 (2014).

LEQUY, Q., DESAULNIERS, G., SOLOMON, M.M. Assigning team tasks and multiple activities to fixed work shifts. INFOR 51(2), 64-75 (2013).

GROIEZ, M., DESAULNIERS, G., HADJAR, A., MARCOTTE, O. 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 (2013).

ELAHIPANAH, M., DESAULNIERS, G., LACASSE-GUAY, E. A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts. Journal of Scheduling 16(5), 443-460 (2013).

SADDOUNE, M., DESAULNIERS, G., SOUMIS, F. Aircrew pairings with possible repetitions of the same flight number. Computers and Operations Research 40(3), 805-814 (2013).

LEQUY, Q., DESAULNIERS, G., SOLOMON, M.M. A two-stage heuristic for multi-activity and task assignment to work shifts. Computers and Industrial Engineering 63(4), 831-841 (2012)

BENCHIMOL, P., DESAULNIERS, G., DESROSIERS, J. Stabilized dynamic constraint aggregation for solving set partitioning problems. European Journal of Operational Research 223(2), 360-371 (2012)

STÅLHANE, M., ANDERSSON, H., CHRISTIANSEN, M., CORDEAU, J.-F., DESAULNIERS, G. A branch-price-and-cut method for a ship routing and scheduling problem with split loads. Computers and Operations Research 39(12), 3361-3375 (2012).

RIBEIRO, G.M., DESAULNIERS, G., DESROSIERS, J. A branch-price-and-cut algorithm for the workover rig routing problem. Computers and Operations Research 39(12), 3305-3315 (2012).

LEQUY, Q., BOUCHARD, M., DESAULNIERS, G., SOUMIS, F., TACHEFINE, B. Assigning multiple activities to work shifts. Journal of Scheduling 15(2), 239-251 (2012).

SADDOUNE, M., DESAULNIERS, G., ELHALLAOUI, I., SOUMIS, F. Integrated airline crew pairing and crew assignment by dynamic constraint aggregation. Transportation Science 46(1), 39-55 (2012).

ELHALLAOUI, I., METRANE, A., DESAULNIERS, G., SOUMIS, F. An improved primal simplex algorithm for degenerate linear programs. INFORMS Journal on Computing 23(4), 569-577 (2011).

DESAULNIERS, G., DESROSIERS, J., SPOORENDONK, S. Cutting planes for branch-and-price algorithms. Networks 58(4), 301-310 (2011).

ARCHETTI, C., BOUCHARD, M., DESAULNIERS, G. Enhanced branch-and-price-and-cut for vehicle routing with split deliveries and time windows. Transportation Science 45(3), 285-298 (2011).

SADDOUNE, M., DESAULNIERS, G., ELHALLAOUI, I., SOUMIS, F. Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods. European Journal of Operational Research 212(3), 445-454 (2011).

DESAULNIERS, G., DESROSIERS, J., SPOORENDONK, S. The vehicle routing problem with time windows: State-of-the-art exact solution methods. Wiley Encyclopedia of Operations Research and Management Science, Vol. 8, J.J. Cochran (ed), Wiley, New York, NY, 5742-5749 (2010).

POTTHOFF, D., HUISMAN, D., DESAULNIERS, G. Column generation with dynamic duty selection for railway crew rescheduling. Transportation Science 44(4), 493-505 (2010).

PRESCOTT-GAGNON, E., DESAULNIERS, G., DREXL, M., ROUSSEAU, L.-M. European driver rules in vehicle routing with time windows. Transportation Science 44(4), 455-473 (2010).

SPOORENDONK, S., DESAULNIERS, G. Clique inequalities for the vehicle routing problem with time windows. INFOR 48 (1), 53-67 (2010).

GRONHAUG, R., CHRISTIANSEN, M., DESAULNIERS, G., DESROSIERS, J. A branch-and-price method for a liquefied natural gas inventory routing problem. Transportation Science 44(3), 400-415 (2010).

LACASSE-GUAY, E., DESAULNIERS, G., SOUMIS, F. Aircraft routing under different business processes. Journal of Air Transport Management 16(5), 258-263 (2010).

IRNICH, S., DESAULNIERS, G., DESROSIERS, J., HADJAR, A. Path reduced costs for eliminating arcs in routing and scheduling. INFORMS Journal on Computing 22(2), 297-313 (2010).

GUTIERREZ-JARPA, G., DESAULNIERS, G., LAPORTE, G., MARIANOV, V. 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 (2010).

ELHALLAOUI, I., METRANE, A., DESAULNIERS, G., SOUMIS, F. Multi-phase dynamic constraint aggregation for set partitioning type problems. Mathematical Programming A 123(2), 345-370 (2010).

DESAULNIERS, G. Branch-and-price-and-cut for the split delivery vehicle routing problem with time windows. Operations Research 58(1), 179-192 (2010).

BOUBAKER, K., DESAULNIERS, G., ELHALLAOUI, I. Bidline scheduling with equity by heuristic dynamic constraint aggregation. Transportation Research Part B 44(1), 50-61 (2010).

PRESCOTT-GAGNON, E., DESAULNIERS, G., ROUSSEAU, L.-M. A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54(4), 190-204 (2009).

GAMACHE, M., HÉBERT-DESGROSEILLIERS, L., DESAULNIERS, G. A generic linear program for an optimal mine production plan. Proceedings of Mine Planning and Equipment Select & Environmental Issues and Waste Management in Energy and Mineral Product, Banff, Canada, November 16-19, 2009, pp. 326-334.

SADDOUNE, M., DESAULNIERS, G., SOUMIS, F. A rolling horizon solution approach for the airline crew pairing problem. Proceedings of the 2009 International Conference on Computers & Industrial Engineering, Troyes, France, July 6-8, 2009, pp. 344-347.

PEPIN, A.-S., DESAULNIERS, G., HERTZ, A., HUISMAN, D. A comparison of five heuristics for the multiple depot vehicle scheduling problem. Journal of Scheduling 12(1), 17-30 (2009).

BOUCHARD, M., HERTZ, A., DESAULNIERS, G. Lower bounds and a tabu search algorithm for the minimum deficiency problem. Journal of Combinatorial Optimization 17(2), 168-191 (2009).

DESAULNIERS, G., LESSARD, F., HADJAR, A. Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Science 42(3), 387-404 (2008).

EL HALLAOUI, I., DESAULNIERS, G., METRANE, A., SOUMIS, F. Bi-dynamic constraint aggregation and subproblem reduction. Computers and Operations Research 35(5), 1713-1724 (2008).

ACHOUR, H., GAMACHE, M., SOUMIS, F., DESAULNIERS, G. An exact solution approach for the preferential bidding system problem in the airline industry. Transportation Science 41(3), 354-365 (2007).

HAMDOUNI, M., SOUMIS, F., DESAULNIERS, G. Parking buses in a depot with stochastic arrival times. European Journal of Operational Research 183(2), 502-515 (2007).

HAMDOUNI, M., DESAULNIERS, G., SOUMIS, F. Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches. Computers and Operations Research 34(11), 3362-3379 (2007).

DESAULNIERS, G., HICKMAN, M., Public transit. Handbooks in Operations Research and Management Science, Transportation, Vol. 14, G. Laporte and C. Barnhart (eds), Elsevier, Amsterdam, 69-127, (2007).

DESAULNIERS, G., Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation. Computers and Operations Research 34(4), 1221-1239 (2007).

BÉLANGER, N., DESAULNIERS, G., SOUMIS, F., DESROSIERS, J., Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues. European Journal of Operational Research 175(3), 1754-1766 (2006).

HAMDOUNI, M., DESAULNIERS, G., MARCOTTE, O., SOUMIS, F., VAN PUTTEN M. Dispatching buses in a depot using block patterns. Transportation Science 40(3), 364-377 (2006).

ROUILLON, S., DESAULNIERS, G., SOUMIS, F., An extended branch-and-bound method for locomotive assignment. Transportation Research Part B 40(5), 404-423 (2006).

BÉLANGER, N., DESAULNIERS, G., SOUMIS, F., DESROSIERS, J., LAVIGNE, J., Weekly airline fleet assignment with homogeneity. Transportation Research Part B 40(4), 306-318 (2006).

ELHALLAOUI, I., VILLENEUVE, D., SOUMIS, F., DESAULNIERS, G., Dynamic aggregation of set partitioning constraints in column generation. Operations Research 53(4), 632-645 (2005).

IRNICH, S., DESAULNIERS, G., Shortest path problems with resource constraints. In G. Desaulniers, J. Desrosiers and M.M. Solomon (eds): Column Generation, Springer, NY, 33-65 (2005).

DESAULNIERS, G., DESROSIERS, J., SOLOMON, M.M. (Eds.) Column generation, Springer, NY (2005).

VILLENEUVE, D., DESAULNIERS, G., The shortest path problem with forbidden paths. European Journal of Operational Research 165(1), 97-107 (2005).

PAQUET, M., MARTEL, A., DESAULNIERS, G., Including technology selection decisions in manufacturing design models. International Journal of Computer Integrated Manufacturing 17(2), 117-125 (2004).

DESAULNIERS, G., LANGEVIN, A., RIOPEL, D., VILLENEUVE, B., Dispatching and conflict-free routing of automated guided vehicles: An exact approach. International Journal of Flexible Manufacturing Systems 15, 309-331 (2003).

LINGAYA, N., CORDEAU, J.-F., DESAULNIERS, G., DESROSIERS, J., SOUMIS, F., Operational car assignment at VIA Rail Canada. Transportation Research Part B 36(9), 755-778 (2002).

DESAULNIERS, G., DESROSIERS, J., ERDMANN, A., SOLOMON, M.M., SOUMIS, F., VRP with pickup and delivery. In P. Toth and D. Vigo (eds.): The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, vol. 9, Philadelphia, PA, 225-242, (2002).

CORDEAU, J.-F., DESAULNIERS, G., DESROSIERS, J., SOLOMON, M.M., SOUMIS, F., VRP with time windows. In P. Toth and D. Vigo (eds.): The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, vol. 9, Philadelphia, PA, 157-193, (2002).

DESAULNIERS, G., DESROSIERS, J., SOLOMON, M.M., Accelerating strategies for column generation methods in vehicle routing and crew scheduling problems. In: Essays and Surveys in Metaheuristics, C.C. Ribeiro et P. Hansen (eds.), Kluwer, Norwell, MA, 309-324 (2002).

HAASE, K., DESAULNIERS, G., DESROSIERS, J., Simultaneous vehicle and crew scheduling in urban mass transit systems. Transportation Science 35(3), 286-303 (2001).

PAQUET, M., MARTEL, A., DESAULNIERS, G., Including technology selection decisions in manufacturing design models. Proceedings of the International Conference on Industrial Engineering and Production Management, Quebec, Canada, August 20-23, 2001.

CORDEAU, J.-F., DESAULNIERS, G., LINGAYA, N., SOUMIS, F., DESROSIERS, J., Simultaneous locomotive and car assignment at VIA Rail Canada. Transportation Research Part B 35(8), 767-787 (2001).

GILL, S., DESAULNIERS, G., HURTEAU, R., AHMADI, M., P2 - Path planning for a polygonal car-like robot in a polygonal environment. Proceedings of the 31st International Symposium on Robotics , Montreal, Canada, May 15-17, 2000, 386-391.

DESAULNIERS, G., VILLENEUVE, D., The shortest path problem with time windows and linear waiting costs. Transportation Science 34(3), 312-319, (2000).

DESAULNIERS, G., DESROSIERS, J., LASRY, A., SOLOMON, M.M., Crew pairing for a regional carrier. In: Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 471, N.H.M. Wilson (ed), Springer, Berlin, 19-41, (1999).

DESAULNIERS, G., LAVIGNE, J., SOUMIS, F., Multi-depot vehicle scheduling problems with time windows and waiting costs. European Journal of Operational Research 111(3), 479-494, (1998).

DESAULNIERS, G., DESROSIERS, J., GAMACHE, M., SOUMIS, F., Crew scheduling in air transportation. In: Fleet Management and Logistics, T. G. Crainic and G. Laporte (eds.), Kluwer, Norwell, MA, 169-185 (1998).

DESAULNIERS, G., DESROSIERS, J., IOACHIM, I., SOLOMON, M.M., SOUMIS, F., VILLENEUVE, D., A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In: Fleet Management and Logistics, T. G. Crainic and G. Laporte (eds.), Kluwer, Norwell, MA, 57-93 (1998). errata

DESAULNIERS, G., SOUMIS, F., LAURENT, J.-C., A shortest path algorithm for a car-like robot in a polygonal environment. International Journal of Robotics Research 17(5), 512-530 (1998).

DESAULNIERS, G., DESROSIERS, J., SOLOMON, M.M., SOUMIS, F., Daily aircraft routing and scheduling. Management Science 43(6), 841-855 (1997).

DESAULNIERS, G., DESROSIERS, J., DUMAS, Y., MARC, S., RIOUX, B., SOLOMON, M.M., SOUMIS, F., Crew pairing at Air France. European Journal of Operational Research 97(2), 245-259 (1997).

DESAULNIERS, G., On shortest paths for a car-like robot maneuvering around obstacles. Robotics and Autonomous Systems 17(3), 139-148 (1996).

DESAULNIERS, G., SOUMIS, F., An efficient algorithm to find a shortest path for a car-like robot. IEEE Transactions on Robotics and Automation 11(6), 819-828 (1995).

LAURENT, J.-C., DESAULNIERS, G., MALHAMÉ, R., SOUMIS, F., A column generation method for optimal load management via control of water heaters. IEEE Transactions on Power Systems 10(3), 1389-1400 (1995).

DESAULNIERS, G., DUBUC, S., SOUMIS, F., Comparaisons de longueurs de courbes et d'aires de surfaces. Annales des Sciences Mathématiques du Québec 17(1), 39-51 (1995).

DESAULNIERS, G., SOUMIS, F., An algorithm for a minimal length trajectory problem. Proceedings of the 9th International Conference on CAD/CAM, Robotics and Factories of the Future, Newark, NJ, (1993).