Solving the Set Covering Problem with a Binary Black Hole Inspired Algorithm.
Álvaro Gómez RubioBroderick CrawfordRicardo SotoEduardo OlguínSanjay MisraAdrián JaramilloSebastián Mansilla VillablancaJuan SalasPublished in: ICCSA (1) (2016)
Keyphrases
- set covering problem
- set covering
- dynamic programming
- computational complexity
- cost function
- simulated annealing
- combinatorial optimization
- optimal solution
- branch and bound algorithm
- objective function
- intelligent agents
- wireless networks
- optimization algorithm
- worst case
- benchmark problems
- test problems
- search space