In this article, we consider the set covering problem with conflict constraints, i.e., from each conflicting pair of columns, at most one column can appear in the feasible solution, and we seek to identify (select) a subset of columns so as to achieve two distinct objectives. The first objective...