USING MODIFICATION OF PRIM’S ALGORITHM AND GNU OCTAVE AND TO SOLVE THE MULTIPERIODS INSTALLATION PROBLEM

USING MODIFICATION OF PRIM’S ALGORITHM AND GNU OCTAVE AND TO SOLVE THE MULTIPERIODS INSTALLATION PROBLEM

The Minimum Spanning Tree (MST) is one of the famous problems that is used mostly as the backbone in many network design problems. Given a graph G(V,E), where V is the set of vertices and E is the set of edges connecting vertices in V, and for every edge eij there is an associated weight cij ?0. The...

Full description

Bibliographic Details
Main Authors: Wamiliana Wamiliana, M. Usman, Warsito Warsito, Warsono Warsono, Jamal I. Daoud
Format: Article
Language:English
Published: IIUM Press, International Islamic University Malaysia 2020-01-01
Series:International Islamic University Malaysia Engineering Journal
Subjects:
multi periods, degree constrained, minimum spanning tree, prims’ algorithms, gnu octave
Online Access:https://journals.iium.edu.my/ejournal/index.php/iiumej/article/view/1088

Similar Items

Similar Items