Approaches to the size constrained weighted set cover problem
The problem is in P and can be solved in $O(m^k)$ time, where $m$ is the number of sets to select from.  For this reason, it is fundamentally different from standard set cover (which is NP-hard) and might not have been studied as much in the complexity theory literature.