Login / Signup
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm.
Luidi Simonetti
Alexandre Salles da Cunha
Abilio Lucena
Published in:
INOC (2011)
Keyphrases
</>
dominating set
np hard
learning algorithm
objective function
connected dominating set
cutting plane algorithm
valid inequalities
computational complexity
optimal solution
dynamic programming
linear programming
randomly generated
search space
convex hull
cost function
upper bound
worst case
mathematical model