APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM
The Set Covering Problem (SCP) is a problem of finding the set of weighted subsets of a ground set of elements that minimizes the costs while covering all of the elements.
Saved in:
Main Author: | |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://utpedia.utp.edu.my/20266/1/HajarRazip_G03597.pdf http://utpedia.utp.edu.my/20266/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The Set Covering Problem (SCP) is a problem of finding the set of weighted subsets
of a ground set of elements that minimizes the costs while covering all of the elements. |
---|