default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarilène Cherkesly
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Marjolein Aerts-Veenstra
, Marilène Cherkesly, Timo Gschwind:
A Unified Branch-Price-and-Cut Algorithm for Multicompartment Pickup and Delivery Problems. Transp. Sci. 58(5): 1121-1142 (2024)- 2023
- [j9]Rosemarie Santa González, Marilène Cherkesly, Teodor Gabriel Crainic, Marie-Ève Rancourt:
Multi-period location routing: An application to the planning of mobile clinic operations in Iraq. Comput. Oper. Res. 159: 106288 (2023) - 2022
- [j8]Marilène Cherkesly, Timo Gschwind:
The pickup and delivery problem with time windows, multiple stacks, and handling operations. Eur. J. Oper. Res. 301(2): 647-666 (2022) - [j7]Tayeb Mhamedi, Henrik Andersson, Marilène Cherkesly, Guy Desaulniers:
A Branch-Price-and-Cut Algorithm for the Two-Echelon Vehicle Routing Problem with Time Windows. Transp. Sci. 56(1): 245-264 (2022) - 2021
- [j6]Marilène Cherkesly, Claudio Contardo:
The conditional p-dispersion problem. J. Glob. Optim. 81(1): 23-83 (2021) - 2020
- [c1]Marilène Cherkesly, Yasmina Maïzi:
A Simulation Model for Short and Long Term Humanitarian Supply Chain Operations Management. WSC 2020: 1360-1371
2010 – 2019
- 2019
- [j5]Marilène Cherkesly, Mercedes Landete, Gilbert Laporte:
Median and covering location problems with interconnected facilities. Comput. Oper. Res. 107: 1-18 (2019) - 2017
- [j4]Marjolein Veenstra, Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte:
The pickup and delivery problem with time windows and handling operations. Comput. Oper. Res. 77: 127-140 (2017) - 2016
- [j3]Marilène Cherkesly, Guy Desaulniers, Stefan Irnich, Gilbert Laporte:
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. Eur. J. Oper. Res. 250(3): 782-793 (2016) - 2015
- [j2]Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte:
A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Comput. Oper. Res. 62: 23-35 (2015) - [j1]Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte:
Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading. Transp. Sci. 49(4): 752-766 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
