The Set Covering Problem (SCP) has long been concentrating the interest of many researchers in the field of Combinatorial Optimization. SCP is a 0-1 integer programming problem that consists in finding a set of solutions which allow to cover a set of needs at the lowest cost possible. There are many applications of these kind of problems, the main ones are: location of services, files selection in a data bank, simplification of boolean expressions, balancing production lines, among others. Different metaheuristics have been proposed to solve it. Here, we present the possibilities to solve Set Covering Problems with Harmony Search.