Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem.
Bernard GendronAbilio LucenaAlexandre Salles da CunhaLuidi SimonettiPublished in: INFORMS J. Comput. (2014)
Keyphrases
- connected dominating set
- hybrid algorithms
- benders decomposition
- dominating set
- network design problem
- mixed integer
- hybrid algorithm
- facility location problem
- exact algorithms
- evolutionary algorithm
- approximation algorithms
- genetic algorithm
- metaheuristic
- simulated annealing
- particle swarm optimization
- np hard
- optimal solution