Browsing by Author "Ardiansyah"
Now showing 1 - 1 of 1
Results Per Page
Sort Options
Item Solving bounded diameter minimum spanning tree problem using hybrid genetic algorithm with modified kruskal approach(Terengganu: Universiti Malaysia Terengganu, 2011-01) ArdiansyahThe 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.