Solving bounded diameter minimum spanning tree problem using hybrid genetic algorithm with modified kruskal approach

Simple item page
dc.contributor.authorArdiansyah
dc.date.accessioned2016-04-29T13:03:42Z
dc.date.available2016-04-29T13:03:42Z
dc.date.issued2011-01
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.identifier.urihttp://hdl.handle.net/123456789/4521
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
Files
Collections
Fakulti Sains dan Teknologi