Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. Gendron, B., Lucena, A., da Cunha, Salles, A., & Simonetti, L. INFORMS Journal on Computing, 26(4):645-657, 2014.
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. [link]Link  Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. [link]Paper  bibtex   
@article{ journals/informs/GendronLCS14,
  added-at = {2014-10-14T00:00:00.000+0200},
  author = {Gendron, Bernard and Lucena, Abilio and da Cunha, Alexandre Salles and Simonetti, Luidi},
  biburl = {http://www.bibsonomy.org/bibtex/2dadd35e5a656074caad7493a4c0aef05/dblp},
  ee = {http://dx.doi.org/10.1287/ijoc.2013.0589},
  interhash = {6f3b50a6795515d15728d1c071360793},
  intrahash = {dadd35e5a656074caad7493a4c0aef05},
  journal = {INFORMS Journal on Computing},
  keywords = {dblp},
  number = {4},
  pages = {645-657},
  title = {Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem.},
  url = {http://dblp.uni-trier.de/db/journals/informs/informs26.html#GendronLCS14},
  volume = {26},
  year = {2014}
}

Downloads: 0