default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSalim Bouamama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j9]Salaheddine Taibi, Lyazid Toumi, Salim Bouamama:
Complex network community discovery using fast local move iterated greedy algorithm. J. Supercomput. 81(1): 182 (2025)- 2024
- [j8]Roberto Maria Rosati
, Salim Bouamama, Christian Blum:
Multi-constructor CMSA for the maximum disjoint dominating sets problem. Comput. Oper. Res. 161: 106450 (2024) - [i2]Salaheddine Taibi, Lyazid Toumi, Salim Bouamama:
Complex network community discovery using fast local move iterated greedy algorithm. CoRR abs/2406.14751 (2024) - 2023
- [j7]Nawel Boukhari, Salim Bouamama:
Square grid Path Planning for Mobile Anchor-Based Localization in Wireless Sensor Networks. Comput. Sci. 24(4) (2023) - [i1]Hayet Dahmri, Salim Bouamama:
A Simulated Annealing-Based Multiobjective Optimization Algorithm for Minimum Weight Minimum Connected Dominating Set Problem. CoRR abs/2312.11527 (2023) - 2022
- [j6]Salim Bouamama, Christian Blum, Pedro Pinacho Davidson:
A Population-Based Iterated Greedy Algorithm for Maximizing Sensor Network Lifetime. Sensors 22(5): 1804 (2022) - [c6]Roberto Maria Rosati, Salim Bouamama, Christian Blum:
Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem. MIC 2022: 306-321 - 2021
- [j5]Salim Bouamama, Christian Blum:
An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks. Algorithms 14(3): 79 (2021) - [j4]Samir Balbal, Salim Bouamama, Christian Blum:
A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets. Algorithms 14(6): 170 (2021) - [c5]Albert López Serrano, Teddy Nurcahyadi, Salim Bouamama, Christian Blum:
Negative learning ant colony optimization for the minimum positive influence dominating set problem. GECCO Companion 2021: 1974-1977 - 2020
- [c4]Hayet Dahmri, Salim Bouamama:
Improved NSGA-II for Minimum Weight Minimum Connected Dominating Set Problem. MISC 2020: 248-261
2010 – 2019
- 2019
- [j3]Salim Bouamama, Christian Blum, Jean-Guillaume Fages:
An algorithm based on ant colony optimization for the minimum connected dominating set problem. Appl. Soft Comput. 80: 672-686 (2019) - [c3]Pedro Pinacho Davidson, Salim Bouamama, Christian Blum:
Application of CMSA to the minimum capacitated dominating set problem. GECCO 2019: 321-328 - 2017
- [c2]Salim Bouamama, Christian Blum:
On solving large-scale instances of the knapsack problem with setup by means of an iterated greedy algorithm. ICSC 2017: 342-347 - 2016
- [j2]Salim Bouamama, Christian Blum:
A hybrid algorithmic model for the minimum weight dominating set problem. Simul. Model. Pract. Theory 64: 57-68 (2016) - 2012
- [j1]Salim Bouamama, Christian Blum, Abdellah Boukerram:
A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Appl. Soft Comput. 12(6): 1632-1639 (2012) - 2010
- [c1]Salim Bouamama, Abdellah Boukerram, Amer F. Al-Badarneh:
Motif Finding Using Ant Colony Optimization. ANTS Conference 2010: 464-471
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:08 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:
