Marilène Cherkesly
Marilène Cherkesly
GERAD, ESG UQÀM
Verified email at uqam.ca
Title
Cited by
Cited by
Year
A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
M Cherkesly, G Desaulniers, G Laporte
Computers & Operations Research 62, 23-35, 2015
562015
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading
M Cherkesly, G Desaulniers, G Laporte
Transportation Science 49 (4), 752-766, 2015
382015
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
M Cherkesly, G Desaulniers, S Irnich, G Laporte
European Journal of Operational Research 250 (3), 782-793, 2016
312016
The pickup and delivery problem with time windows and handling operations
M Veenstra, M Cherkesly, G Desaulniers, G Laporte
Computers & Operations Research 77, 127-140, 2017
212017
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and LIFO loading
M Cherkesly, G Desaulniers, G Laporte
Groupe d'études et de recherche en analyse des décisions, 2013
72013
Community Healthcare Network in Underserved Areas: Design, Mathematical Models, and Analysis
M Cherkesly, MÈ Rancourt, KR Smilowitz
Production and Operations Management 28 (7), 1716-1734, 2019
22019
Le problème de tournées de véhicules avec cueillettes, livraisons, fenêtres de temps et contraintes de manutention
M Cherkesly
École Polytechnique de Montréal, 2015
22015
Median and covering location problems with interconnected facilities
M Cherkesly, M Landete, G Laporte
Computers & Operations Research 107, 1-18, 2019
12019
A Set-Partitioning Formulation for Community Healthcare Network Design in Underserved Areas
M Cherkesly, MÈ Rancourt, KR Smilowitz
CIRRELT, Centre interuniversitaire de recherche sur les réseaux d'entreprise …, 2017
12017
Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and LIFO Loading M. Cherkesly, G. Desaulniers
G Laporte
2013
The system can't perform the operation now. Try again later.
Articles 1–10