A binary multi-verse optimizer algorithm applied to the set covering problem.
Matías ValenzuelaAlvaro PeñaLuis LopezHernan PintoPublished in: ICSAI (2017)
Keyphrases
- set covering problem
- optimization algorithm
- learning algorithm
- objective function
- set covering
- np hard
- computational complexity
- cost function
- particle swarm optimization
- memetic algorithm
- integer programming
- dynamic programming
- optimal solution
- hybrid algorithm
- network architecture
- search space
- graph search
- reinforcement learning