Integer Linear Programming Formulations for Double Roman Domination Problem

02/21/2019
by   Qingqiong Cai, et al.
0

For a graph G= (V,E), a double Roman dominating function (DRDF) is a function f : V →{0,1,2,3} having the property that if f (v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor u with f (u) = 3, and if f (v) = 1, then vertex v must have at least one neighbor u with f (u) > 2. In this paper, we consider the double Roman domination problem (DRDP), which is an optimization problem of finding the DRDF f such that ∑_v∈ V f (v) is minimum. We propose several integer linear programming (ILP) formulations with a polynomial number of constraints for this combinatorial optimization problem, and present computational results for graphs of different types and sizes. Further, we prove that some of our ILP formulations are equivalent to the others regardless of the variables relaxation or usage of less number of constraints and variables. Additionally, we use one ILP formulation to give an H(2(Δ+1))-approximation algorithm and provide an in approximability result for this problem. All proposed ILP formulations and approximation algorithm are evaluated on randomly generated graphs to compare the performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2017

New Integer Linear Programming Models for the Vertex Coloring Problem

The vertex coloring problem asks for the minimum number of colors that c...
research
03/02/2022

Weighted domination models and randomized heuristics

We consider the minimum weight and smallest weight minimum-size dominati...
research
08/02/2023

Signed double Roman domination on cubic graphs

The signed double Roman domination problem is a combinatorial optimizati...
research
11/11/2022

Extended Formulations via Decision Diagrams

We propose a general algorithm of constructing an extended formulation f...
research
01/16/2014

Developing Approaches for Solving a Telecommunications Feature Subscription Problem

Call control features (e.g., call-divert, voice-mail) are primitive opti...
research
10/11/2021

Binary Programming Formulations for the Upper Domination Problem

We consider Upper Domination, the problem of finding the minimal dominat...
research
07/20/2019

An Iterative Vertex Enumeration Method for Objective Space Based Multiobjective Optimization Algorithms

A recent application area of vertex enumeration problem (VEP) is the usa...

Please sign up or login with your details

Forgot password? Click here to reset