Metaheuristics for the Minimum Set Cover Problem: A Comparison.

Lukas Rosenbauer Anthony Stein Helena Stegherr Jörg Hähner

Published in: IJCCI (2020)

Keyphrases

set cover
greedy algorithm
solution space
approximation algorithms
network flow
greedy heuristics
np hard
greedy heuristic
metaheuristic
combinatorial optimization
minimum cost
particle swarm optimization
simulated annealing
data sets
optimization problems
multi dimensional
upper bound
image processing