PENGGUNAAN METODE CUTTING PLANE UNTUK MENYELESAIKAN MINIMUM SPANNING TREE DENGAN KENDALA BOBOT PADA GRAF K_n
This study aims to determine the minimum spanning tree of a complete graph K_n with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method. This algorithm works by reducing the solution area so that it becomes...
Main Authors: | Dewi Suhika, Wamiliana Wamiliana |
---|---|
Format: | Article |
Language: | Indonesian |
Published: |
Universitas Muhammadiyah Metro
2018-06-01
|
Series: | Jurnal Aksioma |
Subjects: | |
Online Access: | http://ojs.fkip.ummetro.ac.id/index.php/matematika/article/view/1353 |
Similar Items
-
SOLVING THE DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM USING TABU AND MODIFIED PENALTY SEARCH METHODS
by: Wamiliana Wamiliana
Published: (2004-01-01) -
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01) -
On calculation of the stability radius for a minimum spanning tree
by: Yauheni D. Zhyvitsa, et al.
Published: (2017-12-01) -
The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01) -
Aplikasi Algoritma Semut Dalam Menentukan Pohon Merentang Minimum (Minimum Spanning Tree) Terhadap Lintasan yang Mengarah ke Pusat Perbelanjaan di Kota Palopo
by: Fatimah Fatimah, et al.
Published: (2020-08-01)