Browsing UT - Mathematics by Subject "local search"
Now showing items 1-1 of 1
-
Penyelesaian Masalah Generalized Minimum Spanning Tree dengan Metode Heuristik Local Search
(2014)Generalized minimum spanning tree (GMST) is a minimum spanning tree of a graph with the nodes partitioned into some node-sets called cluster. GMST can be solved by using local search heuristic method which includes Prim ...