AKSIOMA JURNAL PENDIDIKAN MATEMATIKA
Vol 7, No 1 (2018)

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

Suhika, Dewi (Unknown)
Wamiliana, Wamiliana (Unknown)

Article Info

Publish Date
11 Jun 2018

Abstract

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 narrower. As a result, the feasible solutions that will be investigated become less and less. This is because the cutting plane method works based on the optimal linear programming solution of relaxation solved by the simplex method. In this paper we give illustration of the algorithm applied for two cases, one for K_4 and one for K_5.

Copyrights © 2018




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
436.4 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
AKSIOMA JURNAL PENDIDIKAN MATEMATIKA
Website

Abbrev

matematika

Publisher

Universitas Muhammadiyah Metro

Subject

Education Mathematics

Description

AKSIOMA JOURNAL, e-ISSN: 2442-5419, p-ISSN: 2089-8703 is an information container has scientific articles in the form of research, the study of literature, ideas, application of the theory, the study of critical analysis, and Islāmic studies in the field of science Mathematics Education. AKSIOMA ...