PENGGUNAAN METODE CUTTING PLANE UNTUK MENYELESAIKAN MINIMUM SPANNING TREE DENGAN KENDALA BOBOT PADA GRAF K_n

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

Full description

Bibliographic Details
Main Authors: Dewi Suhika, Wamiliana Wamiliana
Format: Article
Language:Indonesian
Published: Universitas Muhammadiyah Metro 2018-06-01
Series:Jurnal Aksioma
Subjects:
complete graph
cutting plane method
minimum spanning tree
tree
Online Access:http://ojs.fkip.ummetro.ac.id/index.php/matematika/article/view/1353

Internet

http://ojs.fkip.ummetro.ac.id/index.php/matematika/article/view/1353

Similar Items