Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
B Gendron, A Lucena, AS da Cunha… - INFORMS Journal on …, 2014 - pubsonline.informs.org
We present exact algorithms for solving the minimum connected dominating set problem in
an undirected graph. The algorithms are based on two approaches: a Benders …
an undirected graph. The algorithms are based on two approaches: a Benders …
Solving the connected dominating set problem and power dominating set problem by integer programming
In this paper, we propose several integer programming approaches with a polynomial
number of constraints to formulate and solve the minimum connected dominating set …
number of constraints to formulate and solve the minimum connected dominating set …
Identification of key player genes in gene regulatory networks
Background Identifying the gene regulatory networks governing the workings and identity of
cells is one of the main challenges in understanding processes such as cellular …
cells is one of the main challenges in understanding processes such as cellular …
An integer programming approach for fault-tolerant connected dominating sets
This paper considers the minimum k-connected d-dominating set problem, which is a fault-
tolerant generalization of the minimum connected dominating set (MCDS) problem. Three …
tolerant generalization of the minimum connected dominating set (MCDS) problem. Three …
Input node placement restricting the longest control chain in controllability of complex networks
The minimum number of inputs needed to control a network is frequently used to quantify its
controllability. Control of linear dynamics through a minimum set of inputs, however, often …
controllability. Control of linear dynamics through a minimum set of inputs, however, often …
Multi-start local search algorithm for the minimum connected dominating set problems
The minimum connected dominating set (MCDS) problem is a very significant NP-hard
combinatorial optimization problem, and it has been used in many fields such as wireless …
combinatorial optimization problem, and it has been used in many fields such as wireless …
Efficient local search based on dynamic connectivity maintenance for minimum connected dominating set
The minimum connected dominating set (MCDS) problem is an important extension of the
minimum dominating set problem, with wide applications, especially in wireless networks …
minimum dominating set problem, with wide applications, especially in wireless networks …
Integer linear programming models for the weighted total domination problem
Y Ma, Q Cai, S Yao - Applied Mathematics and Computation, 2019 - Elsevier
A total dominating set of a graph G=(V, E) is a subset D of V such that every vertex in V
(including the vertices from D) has at least one neighbour in D. Suppose that every vertex …
(including the vertices from D) has at least one neighbour in D. Suppose that every vertex …
On combinatorial optimization for dominating sets (literature survey, new models)
MS Levin - arXiv preprint arXiv:2009.09288, 2020 - arxiv.org
The paper focuses on some versions of connected dominating set problems: basic problems
and multicriteria problems. A literature survey on basic problem formulations and solving …
and multicriteria problems. A literature survey on basic problem formulations and solving …
[PDF][PDF] Nucds: An efficient local search algorithm for minimum connected dominating set
The minimum connected dominating set (MCDS) problem is an important extension of the
minimum dominating set problem, with wide applications, especially in wireless networks …
minimum dominating set problem, with wide applications, especially in wireless networks …