A Surprisal-Based Greedy Heuristic for the Set Covering Problem.
Tommaso AdamoGianpaolo GhianiEmanuela GuerrieroDeborah PareoPublished in: Algorithms (2023)
Keyphrases
- greedy heuristic
- set covering problem
- np hard
- branch and bound algorithm
- integer programming
- set covering
- column generation
- bi objective
- greedy algorithm
- optimal solution
- knapsack problem
- lower bound
- minimum weight
- linear programming
- branch and bound
- approximation algorithms
- scheduling problem
- linear program
- upper bound
- worst case analysis
- multiple objectives
- combinatorial optimization problems
- dynamic programming
- cost function
- evolutionary algorithm
- user similarity