A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. - Marilène Cherkesly; Guy Desaulniers; Gilbert Laporte (Comput. Oper. Res., 2015)

Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading. - Marilène Cherkesly; Guy Desaulniers; Gilbert Laporte (Transp. Sci., 2015)

Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. - Marilène Cherkesly; Guy Desaulniers; Stefan Irnich; Gilbert Laporte (Eur. J. Oper. Res., 2016)

The pickup and delivery problem with time windows and handling operations. - Marjolein Veenstra; Marilène Cherkesly; Guy Desaulniers; Gilbert Laporte (Comput. Oper. Res., 2017)

Median and covering location problems with interconnected facilities. - Marilène Cherkesly; Mercedes Landete; Gilbert Laporte (Comput. Oper. Res., 2019)

A Simulation Model for Short and Long Term Humanitarian Supply Chain Operations Management. - Marilène Cherkesly; Yasmina Maïzi (WSC, 2020)

The conditional p-dispersion problem. - Marilène Cherkesly; Claudio Contardo (J. Glob. Optim., 2021)

The pickup and delivery problem with time windows, multiple stacks, and handling operations. - Marilène Cherkesly; Timo Gschwind (Eur. J. Oper. Res., 2022)

A Branch-Price-and-Cut Algorithm for the Two-Echelon Vehicle Routing Problem with Time Windows. - Tayeb Mhamedi; Henrik Andersson; Marilène Cherkesly; Guy Desaulniers (Transp. Sci., 2022)

Multi-period location routing: An application to the planning of mobile clinic operations in Iraq. - Rosemarie Santa González; Marilène Cherkesly; Teodor Gabriel Crainic; Marie-Ève Rancourt (Comput. Oper. Res., 2023)

A Unified Branch-Price-and-Cut Algorithm for Multicompartment Pickup and Delivery Problems. - Marjolein Aerts-Veenstra; Marilène Cherkesly; Timo Gschwind (Transp. Sci., 2024)

Ranking Decomposition for the Discrete Ordered Median Problem. - Marilène Cherkesly; Claudio Contardo; Matthieu Gruson (INFORMS J. Comput., 2025)