Optimal Set Covering With Application

The set covering problem (SCP) is a fundamental problem in the class of covering problems.rnGiven a finite set and a family , ,…, rn of subsets of rn . . , , rn1,2,…, the set covering problem is to find the minimum cardinality 1,2,…, suchrnthat . The elements of are called points. Given 1,2,…, , a point is said to berncovered if it belongs to . In the case of minimum cost covering each set have a costrn 0 and our aim will be minimizing Σ such that .rnIn this project I focused, in general, on the subject matter of the problem and the mainrnapplications together with some basic algorithms for obtaining optimal (near-optimal) solutionsrnincluding some MatLab programming.

Get Full Work

Report copyright infringement or plagiarism