BOUAMAMA Salim
Grade: Professeur
Email: salim.bouamama@univ-setif.dz
Département: Informatique
Bureau:
Salim Bouamama is a professor in the Department of Computer Science at Ferhat Abbas University Sétif 1, Algeria. He earned his M.Sc. in Computer Science from the Jordan University of Science and Technology and completed his Ph.D. in 2013 at Ferhat Abbas University Sétif 1, under the supervision of Prof. Christian Blum and Prof. Abdallah Boukerram.Currently, he serves as a teacher-researcher in the Department of Computer Science at Ferhat Abbas University Sétif 1. He is also a member of the Mechatronics Laboratory (LMETR - E1764200), part of the Optics and Precision Mechanics Institute at the same university. Prior to his current role, he worked at the Department of Computer Science at the University of M’sila from October 2006 to October 2017. His research interests lie in combinatorial optimization problems, metaheuristics, intelligent systems, and network optimization.

https://scholar.google.com/citations?user=egDrpoQAAAAJ&hl=fr
https://orcid.org/0000-0002-5842-2850
https://www.webofscience.com/wos/author/record/2129605
https://www.scopus.com/authid/detail.uri?authorId=36602054100
https://sciprofiles.com/profile/SalimBOUAMAMA

    Journaux (7)

  • A Population-Based Iterated Greedy Algorithm for Maximizing Sensor Network Lifetime

    Salim Bouamama, Christian Blum, Pedro Pinacho-Davidson

    Sensors -IF (2020): 3.57 -, 22 (2022), pp 1-20

  • A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets

    Samir Balbal, Salim Bouamama, Christian Blum

    Algorithms, 14 (2021), pp 1-14

  • An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks

    Salim Bouamama and Christian Blum

    Algorithms, 14 (2021), pp 1-15

  • Path Parameters Effect on Localization Using a Mobile Anchor in WSN

    Nawel Boukhari, Salim Bouamama, Adel Moussaoui

    International Journal of Informatics and Applied Mathematics, 3 (2020), pp 12-22

  • An Algorithm Based on Ant Colony Optimization for the Minimum Connected Dominating Set Problem

    Salim Bouamama, Christian Blum, Jean-Guillaume Fages

    Applied Soft Computing, -IF (2018): 4.87 -, 80 (2019), pp 672-686

  • A hybrid algorithmic model for the minimum weight dominating set problem

    Salim Bouamama, Christian Blum

    Simulation Modelling Practice and Theory, Elsevier - IF (2018): 2.42 -, 64 (2016), pp 57-68

  • A population-based iterated greedy algorithm for the minimum weight vertex cover problem

    Salim Bouamama, Christian Blum, Abdellah Boukerram

    Applied Soft Computing, Elsevier -IF (2018): 4.87 -, 12 (2012), pp 1632-1639

    • Conferences Internationales (9)

  • Improved NSGA-II for minimum weight minimum connected dominating set problem

    Hayet Dahmri, Salim Bouamama

    International Symposium on Modelling and Implementation of Complex Systems, Springer press, Batna, Algeria, (2021)

  • Negative learning ant colony optimization for the minimum positive influence dominating set problem

    Albert López Serrano, Teddy Nurcahyadi, Salim Bouamama, Christian Blum

    Proceedings of the Genetic and Evolutionary Computation Conference Companion, ACM press, Lille, France, (2021)

  • Application of CMSA to the Minimum Capacitated Dominating Set Problem

    Pedro Pinacho Davidson, Salim Bouamama, Christian Blum

    Genetic and Evolutionary Computation Conference (GECCO 2019) - ACM press , Prague, Czech Republic, (2019)

  • On Solving Large-Scale Instances of the Knapsack Problem with Setup by means of an Iterated Greedy Algorithm

    Salim Bouamama, Christian Blum

    ICSC 217: 6th International Conference on Systems and Control - IEEE press -, Batna, Algeria, (2017)

  • A randomized population-based iterated greedy algorithm for the minimum weight dominating set problem

    Salim Bouamama, Christian Blum

    ICICS 2015: 6th International Conference on Information and Communication Systems - IEEE press , Amman, Jordan, (2015)

  • Comparison of greedy heuristics for extending wireless sensor network lifetime

    Salim Bouamama

    ECCO XXVI : 26th Conference of the European Chapter on Combinatorial Optimization, Paris, France, (2013)

  • A population-based iterated greedy algorithm for the minimum weight vertex cover problem

    Salim Bouamama, Christian Blum, and Abdellah Boukerram

    ISMP 2012: 21st International Symposium on Mathematical Programming, Berlin, Germany, (2012)

  • Motif Finding Using Ant Colony Optimization

    Salim Bouamama, Abdellah Boukerram, Amer F Al-Badarneh

    ANTS2010 : 7th International Conference on Swarm Intelligence, LNCS (volume 6234) , Springer Verlag, Brussels, Belgium, (2010)

  • Local Instruction Scheduling using Genetic Algorithms

    Salim Bouamama

    4th International Multiconference on Computer Science and Information Technology, Amman, Jordan, (2006)