default search action
Hela Masri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j6]Takwa Tlili
, Hela Masri, Saoussen Krichen:
Towards an efficient collection and transport of COVID-19 diagnostic specimens using genetic-based algorithms. Appl. Soft Comput. 116: 108264 (2022) - [c11]Doniazed Ben Nsir, Afef Ben Brahim, Hela Masri:
Topic modeling and Sentiment Analysis-based Recommender system: A literature review. CoDIT 2022: 903-907 - 2020
- [c10]Malika Becha, Oumayma Riabi, Yasmine Benmessaoud, Hela Masri:
Applications of Big Data in Tourism: A Survey. ADMA 2020: 533-546
2010 – 2019
- 2019
- [j5]Hela Masri, Saoussen Krichen
Metaheuristics for solving the biobjective single-path multicommodity communication flow problem. Int. Trans. Oper. Res. 26(2): 589-614 (2019) - 2018
- [j4]Hela Masri, Saoussen Krichen
Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem. Ann. Oper. Res. 267(1-2): 353-377 (2018) - 2017
- [c9]Mohamed Elyes Ben Haj Kbaier, Hela Masri, Saoussen Krichen
A Personalized Hybrid Tourism Recommender System. AICCSA 2017: 244-250 - 2016
- [c8]Chaima Boufaied, Raja Trabelsi, Hela Masri, Saoussen Krichen
A construction of rotations-based rosters with a Genetic Algorithm. CEC 2016: 2389-2394 - [c7]Raja Trabelsi, Saoussen Krichen
A cooperative game theoretic approach for the ordering problem in supply chain. CoDIT 2016: 246-251 - 2015
- [j3]Hela Masri, Saoussen Krichen
A multi-start variable neighborhood search for solving the single path multicommodity flow problem. Appl. Math. Comput. 251: 132-142 (2015) - [j2]Ons Abdelkhalek, Hela Masri, Saoussen Krichen
An adaptive variable neighborhood search for solving the multi-objective node placement problem. Electron. Notes Discret. Math. 47: 189-196 (2015) - 2014
- [j1]Hela Masri, Saoussen Krichen
A metaheuristic for solving the unsplittable multicommodity flow problem: the maritime surveillance case. Int. J. Bus. Intell. Data Min. 9(3): 254-269 (2014) - [c6]Hela Masri, Saoussen Krichen
A Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Surveillance Case. AAIM 2014: 137-148 - [c5]Hela Masri, Ons Abdelkhalek, Saoussen Krichen
A comparison of multiple objective evolutionary algorithms for solving the multi-objective node placement problem. CoDIT 2014: 152-157 - [c4]Hela Masri, Saoussen Krichen
A Multi-start Tabu Search Approach for Solving the Information Routing Problem. ICCSA (2) 2014: 267-277 - 2013
- [c3]Hela Masri, Adel Guitouni
Towards Efficient Information Exchange in Fusion Networks. ICAISC (2) 2013: 535-546 - 2011
- [c2]Hela Masri, Saoussen Krichen, Adel Guitouni
A Genetic Algorithm for a Joint Routing and Scheduling Problem in Heterogeneous Networks. BIONETICS 2011: 16-28 - [c1]Hela Masri, Saoussen Krichen
An ant colony optimization metaheuristic for solving bi-objective multi-sources multicommodity communication flow problem. WMNC 2011: 1-8
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-05-08 21:51 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: