  Minimum connected dominating set problem is an NP-hard combinatorial
optimization problem in graph theory. Finding connected dominating set is of
high interest in various domains such as wireless sensor networks, optical
networks, and systems biology. Its weighted variant named minimum weight
connected dominating set is also useful in such applications. In this paper, we
propose a simulated annealing algorithm based on a greedy heuristic for
tackling a variant of the minimum connected dominating set problem and that by
exploiting two objectives together namely the cardinality and the total weight
of the connected dominating set. Experimental results compared to those
obtained by a recent proposed research show the superiority of our approach.
