Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/4521
Title: Solving bounded diameter minimum spanning tree problem using hybrid genetic algorithm with modified kruskal approach
Authors: Ardiansyah
Keywords: QA 402.5 .A7 2011
Ardiansyah
Tesis FST 2010
Issue Date: Jan-2011
Publisher: Terengganu: Universiti Malaysia Terengganu
Abstract: The 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.
URI: http://hdl.handle.net/123456789/4521
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


Items in UMT-IR are protected by copyright, with all rights reserved, unless otherwise indicated.