Meta-heuristic based approach for Minimum Vertex Cover Problem

Simple item page
dc.contributor.authorREZZAG LEBZA, MOHAMED AYMEN
dc.date.accessioned2019-07-24T13:07:35Z
dc.date.available2019-07-24T13:07:35Z
dc.date.issued2019
dc.description.abstractIn 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.en_US
dc.identifier.urihttps://repository.univ-msila.dz/handle/123456789/15882
dc.language.isoenen_US
dc.publisherUNIVERSITE MOHAMED BOUDIAF - M’SILA FACULTE DES MATHEMATIQUES ET DE L’INFORMATIQUE DEPARTEMENT D’INFORMATIQUE- Option: IDOen_US
dc.subjectminimum vertex cover problem, heuristics, meta-heuristics, bat algorithm, hybrid algorithmen_US
dc.titleMeta-heuristic based approach for Minimum Vertex Cover Problemen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
REZZAG LEBZA MOHAMED AYMEN.pdf
Size:
5.58 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Master Thesis