• 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
  • Pages
    8
  • From page
    415
  • To page
    422
  • 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
  • Serial Year
    2013
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Record number

    1456246

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=1456246