 | Monter d'un niveau |
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
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
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
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
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
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
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
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
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
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
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
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
