default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMustapha Ratli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Dalibor Ristic
, Nenad Mladenovic, Mustapha Ratli, Raca Todosijevic, Dragan Urosevic:
Auxiliary data structures and techniques to speed up solving of the p-next center problem: A VNS heuristic. Appl. Soft Comput. 140: 110276 (2023)- [j9]Milena Vukicevic, Mustapha Ratli, Atika Rivenq, Maria Zrikem:
Covering delivery problem with electric vehicle and parcel lockers: Variable neighborhood search approach. Comput. Oper. Res. 157: 106263 (2023) - [j8]Issam Krimi, Rachid Benmansour, Raca Todosijevic, Nenad Mladenovic, Mustapha Ratli:
A no-delay single machine scheduling problem to minimize total weighted early and late work. Optim. Lett. 17(9): 2113-2131 (2023) - [j7]Issam Krimi, Rachid Benmansour, Raca Todosijevic, Nenad Mladenovic, Mustapha Ratli:
Correction to: A no-delay single machine scheduling problem to minimize total weighted early and late work. Optim. Lett. 17(9): 2133-2134 (2023) - 2022
- [j6]Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic, Mustapha Ratli:
Solving the Capacitated Dispersion Problem with variable neighborhood search approaches: From basic to skewed VNS. Comput. Oper. Res. 139: 105622 (2022) - [j5]Xiaoning Zang, Li Jiang, Mustapha Ratli, Bin Ding:
A parallel variable neighborhood search for solving covering salesman problem. Optim. Lett. 16(1): 175-190 (2022) - [j4]Mustapha Ratli, Dragan Urosevic, Abdessamad Ait El Cadi, Jack Brimberg, Nenad Mladenovic, Raca Todosijevic:
An efficient heuristic for a hub location routing problem. Optim. Lett. 16(1): 281-300 (2022) - 2020
- [j3]Issam Krimi, Raca Todosijevic, Rachid Benmansour, Mustapha Ratli, Abdessamad Ait El Cadi, Afaf Aloullal:
Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints. J. Glob. Optim. 78(2): 349-373 (2020)
2010 – 2019
- 2015
- [j2]Mohamed Cheikh, Mustapha Ratli, Omar Mkaouar, Bassem Jarboui:
A variable neighborhood search algorithm for the vehicle routing problem with multiple trips. Electron. Notes Discret. Math. 47: 277-284 (2015) - [j1]Manel Kammoun, Houda Derbel, Mustapha Ratli, Bassem Jarboui:
A variable neighborhood search for solving the multi-vehicle covering tour problem. Electron. Notes Discret. Math. 47: 285-292 (2015) - 2014
- [b1]Mustapha Ratli:
Parking management system in a dynamic and multi-objective environment. (Système de gestion du stationnement dans un environnement dynamique et multi-objectifs). University of Valenciennes and Hainaut-Cambresis, France, 2014
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 2024-04-24 23:07 CEST 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:
