Linear Optimization Relaxation for Dynamic Domination Number

In this paper, the concept of dynamic domination number is recalled and a binary linear optimization formulation is presented that is capable to find this number. Linear optimization relaxation of this problem lead to approximate this parameter in polynomial time.

کلیدواژه ها:

Linear Optimization ، Relaxation ، Dynamic Domination Number