Minimum edge blocker dominating set problem
We introduce and study the minimum edge blocker dominating set problem. We prove the NP-hardness of the problem. We formulate the problem as a linear 01 program and investigate its properties. We present the first known exact algorithm for the considered problem.
np-hardness network interdiction minimum weighted dominating set branch-and-cut algorithm critical elements detection