The set covering problem asks for the smallest collection of subsets whose union contains all elements in a given universe. As a canonical NP-hard challenge, it has inspired a rich array of exact, ...