A theoretical justification of the set covering greedy heuristic of Caprara et al.
Torbjörn LarssonNils-Hassan QuttinehPublished in: Discret. Optim. (2022)
Keyphrases
- theoretical justification
- set covering
- greedy heuristic
- np hard
- set covering problem
- integer programming
- greedy algorithm
- knapsack problem
- column generation
- optimal solution
- minimum weight
- lower bound
- set cover
- hypergraph model
- worst case analysis
- special case
- objective function
- data sets
- evolutionary algorithm
- search algorithm