 | Monter d'un niveau |
Altman, C., Desaulniers, G., & Errico, F. (2023). The Fragility-Constrained Vehicle Routing Problem with Time Windows. Transportation Science, 57(2), 552-572. 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
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
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
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
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
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
