DeepAI AI Chat
Log In Sign Up

Binary Programming Formulations for the Upper Domination Problem

by   Ryan Burdett, et al.

We consider Upper Domination, the problem of finding the minimal dominating set of maximum cardinality. Very few exact algorithms have been described for solving Upper Domination. In particular, no binary programming formulations for Upper Domination have been described in literature, although such formulations have proved quite successful for other kinds of domination problems. We introduce two such binary programming formulations, and compare their performance on various kinds of graphs. We demonstrate that the first performs better in most cases, but the second performs better for very sparse graphs. Also included is a short proof that the upper domination of any generalized Petersen graph P(n,k) is equal to n.


page 1

page 2

page 3

page 4


Weighted domination models and randomized heuristics

We consider the minimum weight and smallest weight minimum-size dominati...

An Integer Linear Programming Formulation for the Convex Dominating Set Problems

Due to their importance in practice, dominating set problems in graphs h...

Upper paired domination versus upper domination

A paired dominating set P is a dominating set with the additional proper...

Integer Linear Programming Formulations for Double Roman Domination Problem

For a graph G= (V,E), a double Roman dominating function (DRDF) is a fun...

An integer programming approach for solving a generalized version of the Grundy domination number

A sequence of vertices in a graph is called a legal dominating sequence ...

On combinatorial optimization for dominating sets (literature survey, new models)

The paper focuses on some versions of connected dominating set problems:...

Educational Timetabling: Problems, Benchmarks, and State-of-the-Art Results

We propose a survey of the research contributions on the field of Educat...