Résumé:
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.