 | Monter d'un niveau |
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
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
Cherkesly, M., Desaulniers, G., Irnich, S., & Laporte, G. (2015). Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. (Rapport technique n° G-2015-25). Lien externe
