Please use this identifier to cite or link to this item:
http://umt-ir.umt.edu.my:8080/handle/123456789/4521Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Ardiansyah | - |
| dc.date.accessioned | 2016-04-29T13:03:42Z | - |
| dc.date.available | 2016-04-29T13:03:42Z | - |
| dc.date.issued | 2011-01 | - |
| dc.identifier.uri | http://hdl.handle.net/123456789/4521 | - |
| dc.description.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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Terengganu: Universiti Malaysia Terengganu | en_US |
| dc.subject | QA 402.5 .A7 2011 | en_US |
| dc.subject | Ardiansyah | en_US |
| dc.subject | Tesis FST 2010 | en_US |
| dc.title | Solving bounded diameter minimum spanning tree problem using hybrid genetic algorithm with modified kruskal approach | en_US |
| dc.type | Thesis | en_US |
| Appears in Collections: | Fakulti Sains dan Teknologi | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| tesis QA 402.5 .A7 2011 Abstract.pdf Restricted Access | 841.16 kB | Adobe PDF | View/Open Request a copy | |
| tesis QA 402.5 .A7 2011 FullText.pdf Restricted Access | 11 MB | Adobe PDF | View/Open Request a copy |
Items in UMT-IR are protected by copyright, with all rights reserved, unless otherwise indicated.