MILP formulations have been described for several variants of domination, such as total domination [1]}, Roman domination [1]}, [3]}, [4]}, weak Roman domination [1]}, [6]}, secure domination [7]}, [1]}, connected domination [9]}, [10]}, and power domination [9]}. In particular, Burger et al. [1]} noted that even an unsophisticated approach to solving the MILP formulations for secure domination (i.e. simply submitting it to CPLEX) significantly outperformed the previous best-known exact algorithms from [13]}, and indicated that better formulations or more sophisticated approaches such as column generation techniques could further improve the results; indeed, a superior formulation which can be solved even faster was given in [7]}.
