A note on the generalized min-sum set cover problem.
Martin SkutellaDavid P. WilliamsonPublished in: Oper. Res. Lett. (2011)
Keyphrases
- set cover
- min sum
- np hard
- greedy algorithm
- approximation algorithms
- network flow
- lower bound
- greedy heuristic
- scheduling problem
- integer programming
- optimal solution
- special case
- solution space
- convex hull
- linear programming
- goal programming
- mathematical programming
- minimum cost
- clustering algorithm
- search algorithm
- cost function