Title of article :
Formulations for the Minimum 2-Connected Dominating Set Problem
Author/Authors :
do Forte، نويسنده , , Vinicius Leal and Lucena، نويسنده , , Abilio and Maculan، نويسنده , , Nelson، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2013
Abstract :
Three formulations for the Minimum 2-Connected Dominating Set Problem, valid inequalities, a primal heuristic and Branch-and-Cut algorithms are introduced in this paper. As shown here, the preliminary computational results so far obtained indicate that these algorithms are quite promising.
Keywords :
dominating sets , 2-connected graphs , branch-and-cut algorithms
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
