A Mixed Integer Linear Programming Formulation for Restrained Roman Domination Problem

Abstract

This paper deals with a subgroup of Roman domination problems (RDP) named Restrained Roman domination
problem (RRDP). It introduces a new mixed integer linear programming (MILP) formulation for the RRDP. The presented
model uses relatively small number of the variables and constraints and could be of use both in theoretical and
practical purposes. Proof of its correctness is given, i.e. it was shown that optimal solution to the RRDP formulation
is equal to the optimal solution of the original problem.