Multi Objective Set Covering Problem, an Exact Approach by Gonçalo José Reis Bento Paredes MSc thesis presentation and discussion. Date: 2021-Nov-26 Time: 13:00 Room: Zoom Abstract: The set covering problem has been deeply studied over the years, both in the single objective case and in the multi objective case. However, for the multi objective set covering problem there has not been any tailor made attempts of determining the exact elements of the Pareto front, just applications of generic approaches. For this, we came up with an approach based on the branch and bound algorithm to find all the elements of the Pareto front of the multi-objective set covering problem and then analyzed its performance.