Yes, the Set Cover Problem is a type of optimisation problem in computer science. The goal is to find the smallest sub-collection of sets that covers all elements of a universe.