A Multi Dynamic Binary Black Hole Algorithm Applied to Set Covering Problem.

José García Broderick Crawford Ricardo Soto Pablo García

Published in: ICHSA (2017)

Keyphrases

set covering problem
optimal solution
dynamic programming
cost function
worst case
column generation
np hard
bi objective
multi agent
cooperative
lower bound
particle swarm optimization
optimization algorithm
integer programming
minimum spanning tree