set cover problem

Set covering problem (SCP) is an important oprimization problem, wich is popular among researchers and practice. Many application in various fields can be reviewed as this problem. In this paper, there is presented two solutions of SCP. One is greedy algorythm, wich gives us an approximation solution, and the other is by casting this problem to integer programming problem, and solving it with Gurobi ( Linear and Mixed-Integer Programming  Solver). It gives us an exact soluton.