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. 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
{"_id":"ShhzaRBukjAnLj224","bibbaseid":"gendron-lucena-danbspcunha-salles-simonetti-bendersdecompositionbranchandcutandhybridalgorithmsfortheminimumconnecteddominatingsetproblem-2014","downloads":0,"creationDate":"2015-05-07T12:05:12.711Z","title":"Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem.","author_short":["Gendron, B.","Lucena, A.","da<nbsp>Cunha","Salles, A.","Simonetti, L."],"year":2014,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/bernard?items=1000","bibdata":{"added-at":"2014-10-14T00:00:00.000+0200","author":["Gendron, Bernard","Lucena, Abilio","da Cunha","Salles, Alexandre","Simonetti, Luidi"],"author_short":["Gendron, B.","Lucena, A.","da<nbsp>Cunha","Salles, A.","Simonetti, L."],"bibtex":"@article{ journals/informs/GendronLCS14,\n added-at = {2014-10-14T00:00:00.000+0200},\n author = {Gendron, Bernard and Lucena, Abilio and da Cunha, Alexandre Salles and Simonetti, Luidi},\n biburl = {http://www.bibsonomy.org/bibtex/2dadd35e5a656074caad7493a4c0aef05/dblp},\n ee = {http://dx.doi.org/10.1287/ijoc.2013.0589},\n interhash = {6f3b50a6795515d15728d1c071360793},\n intrahash = {dadd35e5a656074caad7493a4c0aef05},\n journal = {INFORMS Journal on Computing},\n keywords = {dblp},\n number = {4},\n pages = {645-657},\n title = {Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem.},\n url = {http://dblp.uni-trier.de/db/journals/informs/informs26.html#GendronLCS14},\n volume = {26},\n year = {2014}\n}","bibtype":"article","biburl":"http://www.bibsonomy.org/bibtex/2dadd35e5a656074caad7493a4c0aef05/dblp","ee":"http://dx.doi.org/10.1287/ijoc.2013.0589","id":"journals/informs/GendronLCS14","interhash":"6f3b50a6795515d15728d1c071360793","intrahash":"dadd35e5a656074caad7493a4c0aef05","journal":"INFORMS Journal on Computing","key":"journals/informs/GendronLCS14","keywords":"dblp","number":"4","pages":"645-657","title":"Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem.","type":"article","url":"http://dblp.uni-trier.de/db/journals/informs/informs26.html#GendronLCS14","volume":"26","year":"2014","bibbaseid":"gendron-lucena-danbspcunha-salles-simonetti-bendersdecompositionbranchandcutandhybridalgorithmsfortheminimumconnecteddominatingsetproblem-2014","role":"author","urls":{"Link":"http://dx.doi.org/10.1287/ijoc.2013.0589","Paper":"http://dblp.uni-trier.de/db/journals/informs/informs26.html#GendronLCS14"},"keyword":["dblp"],"downloads":0},"search_terms":["benders","decomposition","branch","cut","hybrid","algorithms","minimum","connected","dominating","set","problem","gendron","lucena","da<nbsp>cunha","salles","simonetti"],"keywords":["dblp"],"authorIDs":[],"dataSources":["wvAhRjakvxMweG8ZA"]}