33 citations · 54 across the 8 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2022★ 5 cited
Solving the signed Roman domination and signed total Roman domination problems with exact and heuristic methods
Vladimir Filipović, Dragan Matić, Aleksandar Kartelj
In this paper we deal with the signed Roman domination and signed total Roman domination problems. For each problem we propose two integer linear programming (ILP) formulations, th…
math.OC2019★ 4 cited
An Integer Linear Programming Formulation for the Convex Dominating Set Problems
Jozef Kratica, Vladimir Filipovic, Dragan Matic +1
Due to their importance in practice, dominating set problems in graphs have been greatly studied in past and different formulations of these problems are presented in literature. T…