default search action
Safa Bhar Layeb
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Hana Ben Mbarek, Najla Omrane Aissaoui
, Amel Jaoua
A human behaviour-based simulation model for resource allocation at a multi-specialty outpatient clinic. J. Simulation 18(3): 283-310 (2024) - [c13]Amel Jaoua, Elisa Negri, Hajer Hamdaoui, Safa Bhar Layeb:
A Simulation-Based Optimization Approach Towards Human-Centric Scheduling in Presence of Heterogeneous Workforce. ANNSIM 2024: 1-12 - [c12]Imen Mejri, Safa Bhar Layeb, Maryem Benslimane:
Learning-driven Evolutionary Optimization for the Traveling Salesman Problem. CoDIT 2024: 1347-1351 - 2023
- [j9]Safa Elkefi
Telemedicine's future in the post-Covid-19 era, benefits, and challenges: a mixed-method cross-sectional study. Behav. Inf. Technol. 42(15): 2639-2653 (2023) - 2022
- [c11]Tounsi Achraf
On Coupling a Content-Based Routing Process with a Multi-label Residual Convolutional Neural Network Text Classifier. ICO 2022: 3-13 - [c10]Imen Mejri, Safa Bhar Layeb
Solving a Generalized Network Design Problem Using the Archimedes Optimization Algorithm. ICO 2022: 14-23 - [c9]Oumaima Soltani, Safa Bhar Layeb
Evolutionary Reinforcement Learning for Solving a Transportation Problem. ICO 2022: 429-438 - [c8]Safa Bhar Layeb
Reinforcement Learning Based Graphical User Interface to Solve the Permutation Flow Shop Problem. ICO 2022: 1058-1068 - 2021
- [c7]Amina Antit, Safa Bhar Layeb
Management of Shared Customers Through Pool Collaboration in Last-Mile Transportation. ICIT 2021: 224-229 - [c6]Nour El Houda Hammami, Amel Jaoua
Equipment Dispatching Problem for Underground Mine Under Stochastic Working Times. ICCL 2021: 429-441 - [c5]Imen Mejri, Safa Bhar Layeb
Tailoring a Red Deer Algorithm to Solve a Generalized Network Design Problem. IN4PL 2021: 32-39 - 2020
- [j8]Mohamed Aziz Jegham, Safa Bhar Layeb
Locating and sizing electric vehicles charging stations in new markets. Int. J. Appl. Decis. Sci. 13(2): 153-182 (2020)
2010 – 2019
- 2019
- [j7]Sonia Khatrouch, Safa Bhar Layeb
Bio-inspired metaheuristics for the generalised discrete cost multicommodity network design problem. Int. J. Metaheuristics 7(2): 176-196 (2019) - [j6]Imen Mejri, Mohamed Haouari
An exact approach for the multicommodity network optimization problem with a step cost function. RAIRO Oper. Res. 53(4): 1279-1295 (2019) - [c4]Imen Mejri, Safa Bhar Layeb
Enhanced Exact Approach for the Network Loading Problem. CoDIT 2019: 970-975 - [c3]Faten Ben Chihaoui, Nouha Maddeh, Safa Bhar Layeb
A Decision Support System for Drug Inventory Management within an Emergency Department: A Case Study. CoDIT 2019: 1889-1894 - [c2]Hejer Khlif Hachicha, Sarra Ben Rebah, Safa Bhar Layeb
A New MILP-based Decision Support System for the Fuel Distribution. ICTA 2019: 1-6 - 2018
- [j5]Safa Bhar Layeb
A simulation-optimization approach for scheduling in stochastic freight transportation. Comput. Ind. Eng. 126: 99-110 (2018) - 2016
- [c1]Nesrine Bakkar Ennaifer, Safa Bhar Layeb
On lower bounds computation for the Discrete Cost Multicommodity Network Design Problem. CoDIT 2016: 511-516 - 2013
- [j4]Mohamed Haouari
Tight compact models and comparative analysis for the prize collecting Steiner tree problem. Discret. Appl. Math. 161(4-5): 618-632 (2013) - 2010
- [j3]Mohamed Haouari
Algorithmic expedients for the Prize Collecting Steiner Tree Problem. Discret. Optim. 7(1-2): 32-47 (2010) - [j2]Mohamed Haouari
Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint. Electron. Notes Discret. Math. 36: 495-502 (2010)
2000 – 2009
- 2008
- [j1]Mohamed Haouari
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches. Comput. Optim. Appl. 40(1): 13-39 (2008)
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-11-13 23:51 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: