Salim Bouamama

Orcid: 0000-0002-5842-2850

According to our database1, Salim Bouamama authored at least 16 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Multi-constructor CMSA for the maximum disjoint dominating sets problem.
Comput. Oper. Res., January, 2024

Complex network community discovery using fast local move iterated greedy algorithm.
CoRR, 2024

2023
A Simulated Annealing-Based Multiobjective Optimization Algorithm for Minimum Weight Minimum Connected Dominating Set Problem.
CoRR, 2023

Square grid Path Planning for Mobile Anchor-Based Localization in Wireless Sensor Networks.
Comput. Sci., 2023

2022
A Population-Based Iterated Greedy Algorithm for Maximizing Sensor Network Lifetime.
Sensors, 2022

Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem.
Proceedings of the Metaheuristics - 14th International Conference, 2022

2021
An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks.
Algorithms, 2021

A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets.
Algorithms, 2021

Negative learning ant colony optimization for the minimum positive influence dominating set problem.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020
Improved NSGA-II for Minimum Weight Minimum Connected Dominating Set Problem.
Proceedings of the Modelling and Implementation of Complex Systems, 2020

2019
An algorithm based on ant colony optimization for the minimum connected dominating set problem.
Appl. Soft Comput., 2019

Application of CMSA to the minimum capacitated dominating set problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

2017
On solving large-scale instances of the knapsack problem with setup by means of an iterated greedy algorithm.
Proceedings of the 6th International Conference on Systems and Control, 2017

2016
A hybrid algorithmic model for the minimum weight dominating set problem.
Simul. Model. Pract. Theory, 2016

2012
A population-based iterated greedy algorithm for the minimum weight vertex cover problem.
Appl. Soft Comput., 2012

2010
Motif Finding Using Ant Colony Optimization.
Proceedings of the Swarm Intelligence - 7th International Conference, 2010


  Loading...