Optimal Set Covering With Application
| dc.contributor.advisor | Guta, Berhanu (PhD) | |
| dc.contributor.author | Abebe, Samuel | |
| dc.date.accessioned | 2020-12-10T09:12:22Z | |
| dc.date.accessioned | 2023-11-04T12:31:01Z | |
| dc.date.available | 2020-12-10T09:12:22Z | |
| dc.date.available | 2023-11-04T12:31:01Z | |
| dc.date.issued | 2011-01-01 | |
| dc.description.abstract | The set covering problem (SCP) is a fundamental problem in the class of covering problems. Given a finite set and a family , ,…, of subsets of . . , , 1,2,…, the set covering problem is to find the minimum cardinality 1,2,…, such that . The elements of are called points. Given 1,2,…, , a point is said to be covered if it belongs to . In the case of minimum cost covering each set have a cost 0 and our aim will be minimizing Σ such that . In this project I focused, in general, on the subject matter of the problem and the main applications together with some basic algorithms for obtaining optimal (near-optimal) solutions including some MatLab programming. | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/23948 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Optimal Set | en_US |
| dc.subject | Covering | en_US |
| dc.subject | Application | en_US |
| dc.title | Optimal Set Covering With Application | en_US |
| dc.type | Thesis | en_US |