Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem

• Bernard Gendron

  Bernard Gendron

  [email protected]

  Département d'informatique et de recherche opérationnelle, Université de Montréal, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Montreal, Quebec, Canada H3T 1J4

  Search for more papers by this author

  ,
• Abilio Lucena

  Abilio Lucena

  [email protected]

  Departamento de Administração and Programa de Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, 21941-901, Brasil

  Search for more papers by this author

  ,
• Alexandre Salles da Cunha

  Alexandre Salles da Cunha

  [email protected]

  Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Belo Horizonte, 31270-901, Brasil

  Search for more papers by this author

  ,
• Luidi Simonetti

  Luidi Simonetti

  [email protected]

  Instituto de Computação, Universidade Federal Fluminense, Niteroi CEP 24210-240, Brasil

  Search for more papers by this author