<  Back to the Polytechnique Montréal portal

Items where Author is "Cherkesly, Marilène"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Jump to: C | M
Number of items: 8.

C

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. External link

Cherkesly, M. (2015). Le problème de tournées de véhicules avec cueillettes, livraisons, fenêtres de temps et contraintes de manutention [Ph.D. thesis, École Polytechnique de Montréal]. Available

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. (Technical Report n° G-2015-25). External link

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. External link

Cherkesly, M., Desaulniers, G., & Laporte, G. (2014). A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. (Technical Report n° G-2014-66). External link

Cherkesly, M., Desaulniers, G., & Laporte, G. (2013). Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and LIFO Loading. (Technical Report n° G-2013-31). External link

M

Mhamedi, T., Cherkesly, M., & Desaulniers, G. (2024). A branch-price-and-cut algorithm for the multi-commodity two-echelon vehicle routing problem with time windows. (Technical Report n° G-2024-79). External link

Mhamedi, T., Andersson, H., Cherkesly, M., & Desaulniers, G. (2020). A branch-price-and-cut algorithm for the two-echelon vehicle routing problem with time windows. (Technical Report n° G-2020-63). External link

List generated on: Tue Apr 14 09:20:49 2026 EDT