Lab 1 (set cover problem) The Set Cover Problem is a classical optimization problem in computer science and mathematical optimization. Given a universe 𝑈 of elements and a collection 𝑆 of subsets of 𝑈, the goal is to find the smallest sub-collection of sets from 𝑆 whose union covers all elements in the universe 𝑈.