DEVELOPING GENETIC LOCAL SEARCH ALGORITHM (GLS) SOFTWARE PROTOTYPE FOR QUADRATIC MINIMUM SPANNING TREE (q-MST) PROBLEM
Abstract: <br /> <br /> <br /> <br /> <br /> Minimum Spanning Tree (MST) is the most important spanning tree and have a broad application in practice. The problem of finding the minimum spanning tree has known for over 100 years. Compared to conventional minimum sp...
Saved in:
Main Author: | Violina (NIM 235 04 040), Sriyani |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/9326 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
PENDEKATAN ALGORITMA GENETIK
BAGI PERSOALAN dc-MST
(degree constrained-Minimum Spanning Tree)
by: NANIEK INDRAWATY, 080012116
Published: (2005) -
An Alternative to Optimize the Indonesian's Airport Network Design: AnApplication of Minimum Spanning Tree (MST)Technique
by: Perpustakaan UGM, i-lib
Published: (2012) -
ALGORITMA GENETIK DENGAN CROSSOVER UNIFORM
UNTUK MASALAH DC-MST
(DEGREE CONSTRAINED MINIMUM SPANNING TREE)
by: WIWIN INDRIANI, 080012216
Published: (2005) -
GENERALIZED SPACE TIME AUTOREGRESSIVE (GSTAR) MODELING WITH MINIMUM SPANNING TREE (MST) SPATIAL WEIGHT MATRICES IN TRAFFIC FLOW
by: Yolanda, Feby -
On minimum spanning trees and determinants
by: Sy, Mark Benlor B.
Published: (2002)