1. UMT Institutional Repository
  2. Thesis Collections
  3. Fakulti Sains dan Teknologi
Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/4521
Full metadata record
DC FieldValueLanguage
dc.contributor.authorArdiansyah-
dc.date.accessioned2016-04-29T13:03:42Z-
dc.date.available2016-04-29T13:03:42Z-
dc.date.issued2011-01-
dc.identifier.urihttp://hdl.handle.net/123456789/4521-
dc.description.abstractThe bounded diameter minimum spanning tree (BDMST) problem is a combinatorial optimization problem in graph theory which has its main application in network design. The goal of this problem is to find a minimum cost of all spanning trees in the graph where the number of edges between any pair of nodes, is limited by a given constant.en_US
dc.language.isoenen_US
dc.publisherTerengganu: Universiti Malaysia Terengganuen_US
dc.subjectQA 402.5 .A7 2011en_US
dc.subjectArdiansyahen_US
dc.subjectTesis FST 2010en_US
dc.titleSolving bounded diameter minimum spanning tree problem using hybrid genetic algorithm with modified kruskal approachen_US
dc.typeThesisen_US
Appears in Collections:Fakulti Sains dan Teknologi

Files in This Item:
File Description SizeFormat 
tesis QA 402.5 .A7 2011 Abstract.pdf
  Restricted Access		841.16 kBAdobe PDFView/Open Request a copy
tesis QA 402.5 .A7 2011 FullText.pdf
  Restricted Access		11 MBAdobe PDFView/Open Request a copy
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.