
An Integer Linear Programming Formulation for the Convex Dominating Set Problems
Due to their importance in practice, dominating set problems in graphs h...
read it

Upper paired domination versus upper domination
A paired dominating set P is a dominating set with the additional proper...
read it

Integer Linear Programming Formulations for Double Roman Domination Problem
For a graph G= (V,E), a double Roman dominating function (DRDF) is a fun...
read it

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 ...
read it

On combinatorial optimization for dominating sets (literature survey, new models)
The paper focuses on some versions of connected dominating set problems:...
read it

An Experimental Study of ILP Formulations for the Longest Induced Path Problem
Given a graph G=(V,E), the longest induced path problem asks for a maxim...
read it

Review on Ranking and Selection: A New Perspective
In this paper, we briefly review the development of rankingandselectio...
read it
Binary Programming Formulations for the Upper Domination Problem
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.
READ FULL TEXT
Comments
There are no comments yet.