FUZZY SET COVERING PROBLEM

The classical set covering problem is one of the well known NP-hard problems from discrete optimization. It consists of finding the cheapest covering of a finite set with a subsystem of a finite system of its subsets and has been investigated by many authors in various formulations. Here, two formulations are considered and corresponding results are presented.