default search action
Sohaib Afifi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Sohaib Afifi
, Mustapha Hrouga, Anis Mjirda, Hamid Allaoui
A memetic based algorithm for simultaneous preventive maintenance scheduling and spare-parts inventory management for manufacturing systems. Appl. Soft Comput. 151: 111161 (2024) - [c8]Tuan-Anh Vu, Sohaib Afifi, Eric Lefèvre, Frédéric Pichon:
Optimization Under Severe Uncertainty: a Generalized Minimax Regret Approach for Problems with Linear Objectives. BELIEF 2024: 197-204 - 2023
- [j3]Ala-Eddine Yahiaoui
Enhanced iterated local search for the technician routing and scheduling problem. Comput. Oper. Res. 160: 106385 (2023) - [j2]Tuan-Anh Vu
Optimization problems with evidential linear objective. Int. J. Approx. Reason. 161: 108987 (2023) - [c7]Tuan-Anh Vu, Sohaib Afifi
0-1 Combinatorial Optimization Problems with Qualitative and Uncertain Profits. IUKM (1) 2023: 139-151 - [i1]Ala-Eddine Yahiaoui, Sohaib Afifi
Enhanced Iterated local search for the technician routing and scheduling problem. CoRR abs/2303.13532 (2023) - 2022
- [c6]Tuan-Anh Vu, Sohaib Afifi
On Modelling and Solving the Shortest Path Problem with Evidential Weights. BELIEF 2022: 139-149 - [c5]Tuan-Anh Vu, Sohaib Afifi, Eric Lefèvre, Frédéric Pichon:
Problème du plus court chemin avec poids évidentiels : modélisation et résolution. LFA 2022 - 2021
- [c4]Tekwa Tedjini, Sohaib Afifi
An Extension of Specificity-Based Approximations to Other Belief Function Relations. BELIEF 2021: 224-233 - [c3]Tekwa Tedjini, Sohaib Afifi
The Vehicle Routing Problem with Time Windows and Evidential Service and Travel Times: A Recourse Model. ECSQARU 2021: 381-395
2010 – 2019
- 2016
- [j1]Sohaib Afifi
Heuristic solutions for the vehicle routing problem with time windows and synchronized visits. Optim. Lett. 10(3): 511-525 (2016) - 2015
- [b1]Sohaib Lafifi:
Vehicle Routing Problems with Resources Synchronization. (Problèmes de Tournées de Véhicules avec Synchronisation de Ressources). University of Technology of Compiègne, France, 2015 - 2014
- [c2]Sohaib Afifi
New Lower Bounds on the Number of Vehicles for the Vehicle Routing Problem with Time Windows. CPAIOR 2014: 422-437 - 2013
- [c1]Sohaib Afifi
A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints. LION 2013: 259-265
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-08-29 21:00 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: