DSpace Repository

A Hybrid Metaheuristic for the Minimum Weight Dominating Set Problem

Show simple item record

dc.contributor.author LOUANAS, Salma
dc.date.accessioned 2018-01-31T08:49:58Z
dc.date.available 2018-01-31T08:49:58Z
dc.date.issued 2017
dc.identifier.uri http://dspace.univ-msila.dz:8080//xmlui/handle/123456789/1910
dc.description.abstract In this memory, we deal with a classical problem in graph theory the minimum weight dominating set problem. The latter belong to the class of NP-complete problems where no efficient algorithm is known to solve it to optimality. We have implemented a hybrid algorithm that combines a modified carousel greedy algorithm and local search to give near optimal solutions within a reasonable computation-time to this problem. Experimental results show that the algorithm has competitive performance with a recent published ant colony optimization approach. en_US
dc.language.iso en en_US
dc.publisher FACULTE Mathématique et Informatique - UNIVERSITE MOHAMED BOUDIAF - M’SILA en_US
dc.subject NP-Complete,Carousel Greedy,Local Search,minimum weight dominating set problem en_US
dc.title A Hybrid Metaheuristic for the Minimum Weight Dominating Set Problem en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account