Using modification of Prim's algorithm and GNU Octave and to solve the multiperiods installation problem

• Main Authors: ,, Wamiliana, Usman, Mustofa, ,, Warsono, Daoud, Jamal Ibrahim
• Format: Article
• Language: English; English; English
• Published: International Islamic University Malaysia 2020
• Subjects: T Technology (General)
• Online Access: http://irep.iium.edu.my/87928/1/87928_USING%20MODIFICATION%20OF%20PRIM%E2%80%99S_article.pdf; http://irep.iium.edu.my/87928/2/87928_USING%20MODIFICATION%20OF%20PRIM%E2%80%99S_scopus.pdf; http://irep.iium.edu.my/87928/13/87928_Using%20modification%20of%20Prim%27s%20algorithm_WoS.pdf; http://irep.iium.edu.my/87928/; https://journals.iium.edu.my/ejournal/index.php/iiumej/article/view/1088/728

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....