DSpace Repository
Solving bounded diameter minimum spanning tree problem using hybrid genetic algorithm with modified kruskal approach
- DSpace Home
- →
- Thesis Collections
- →
- Fakulti Sains dan Teknologi
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| 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 |
