Monter d'un niveau |
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., & 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
Laporte, G., & Pesant, G. (2004). A General Multi-Shift Scheduling System. Journal of the Operational Research Society, 55(11), 1208-1217. Lien externe
Blais, M., Lapierre, S., & Laporte, G. (2003). Solving a Home-Care Districting Problem in an Urban Setting. Journal of the Operational Research Society, 54(11), 1141-1147. Lien externe
Pesant, G., & Laporte, G. (janvier 2002). Algorithme robuste pour la confection d'horaires cycliques [Communication écrite]. Journées francophones de programmation logique et programmation par contraintes (JFPLC 2002), Nice, France. Non disponible
Bourjolly, J.-M., Laporte, G., & Pesant, G. (2002). An exact algorithm for the maximum k-club problem in an undirected graph. European Journal of Operational Research, 138(1), 21-28. Lien externe
Ghiani, G., Hertz, A., & Laporte, G. (2002). Recent algorithmic advances for arc routing problems. Dans Kozan, E., & Ohuchi, A. (édit.), Operations research/management science at work (Vol. 43, p. 1-20). Lien externe
Bourjolly, J. M., Laporte, G., & Pesant, G. (2000). Heuristics for Finding k-Clubs in an Undirected Graph. Computers & Operations Research, 27(6), 559-569. Lien externe
Mbaraga, P., Langevin, A., & Laporte, G. (1999). Two Exact Algorithms for the Vehicle Routing Problem on Trees. Naval Research Logistics, 46(1), 75-89. Lien externe