Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    New user? Click here to register. Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of Digital Repository
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "REZZAG LEBZA, MOHAMED AYMEN"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Meta-heuristic based approach for Minimum Vertex Cover Problem
    (UNIVERSITE MOHAMED BOUDIAF - M’SILA FACULTE DES MATHEMATIQUES ET DE L’INFORMATIQUE DEPARTEMENT D’INFORMATIQUE- Option: IDO, 2019) REZZAG LEBZA, MOHAMED AYMEN
    In this study, we deal with one of the fundamental problems in graph theory and combinatorial optimization, that is, the minimum vertex cover problem (MVCP). We make a comparison between well-known heuristic: genetic algorithm and new metaheuristic: bat algorithm. Also, a hybrid algorithm is proposed to obtain much more optimal result. A comparison is applied to decides which of these three algorithms is much butter to find the optimal solution to the minimum vertex cover problem.

All Rights Reserved - University of M'Sila - UMB Electronic Portal © 2024

  • Cookie settings
  • Privacy policy
  • Terms of Use