This work deals with the so-called weighted independent domination problem, which is an $NP$-hard combinatorial optimization problem in graphs. In contrast to previous work, this paper considers the problem from a ...