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.

Main Author: MOHAMAD RAZIP, HAJAR
Format: Thesis
Language: English
Institution: Universiti Teknologi Petronas
Record Id / ISBN-0: utp-utpedia.20266 /
Published: 2019
Subjects:
T Technology (General)
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!
id utp-utpedia.20266
recordtype eprints
spelling utp-utpedia.202662020-03-19T13:13:28Z http://utpedia.utp.edu.my/20266/ APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM MOHAMAD RAZIP, HAJAR T Technology (General) 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. 2019-04 Thesis NonPeerReviewed application/pdf en http://utpedia.utp.edu.my/20266/1/HajarRazip_G03597.pdf MOHAMAD RAZIP, HAJAR (2019) APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM. Masters thesis, Universiti Teknologi PETRONAS.
institution Universiti Teknologi Petronas
collection UTPedia
language English
topic T Technology (General)
spellingShingle T Technology (General)
MOHAMAD RAZIP, HAJAR
APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM
description 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.
format Thesis
author MOHAMAD RAZIP, HAJAR
author_sort MOHAMAD RAZIP, HAJAR
title APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM
title_short APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM
title_full APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM
title_fullStr APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM
title_full_unstemmed APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM
title_sort approximation algorithm-based initial population generation for the genetic algorithm solution of the set covering problem
publishDate 2019
url http://utpedia.utp.edu.my/20266/1/HajarRazip_G03597.pdf
http://utpedia.utp.edu.my/20266/
_version_ 1741195598035419136
score 11.62408

Similar Items