PENENTUAN MATCHING MAKSIMUM PADA GRAF BIPARTIT BERBOBOT MENGGUNAKAN METODE HUNGARIAN

Main Authors: Abrori, Muchammad, Wahyuningsih, Rina
Format: Article info application/pdf eJournal
Bahasa: ind
Terbitan: Universitas Muhammadiyah Surakarta , 2012
Subjects:
Online Access: http://journals.ums.ac.id/index.php/jiti/article/view/984
http://journals.ums.ac.id/index.php/jiti/article/view/984/678
ctrlnum article-984
fullrecord <?xml version="1.0"?> <dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><title lang="id-ID">PENENTUAN MATCHING MAKSIMUM PADA GRAF BIPARTIT BERBOBOT MENGGUNAKAN METODE HUNGARIAN</title><creator>Abrori, Muchammad</creator><creator>Wahyuningsih, Rina</creator><subject lang="id-ID">matching; graph; assignment problem; Hungarian method</subject><description lang="id-ID">Matching is a part of graph theory that discuss to make a pair, that can be used to solve many problems; one of them is the assignment problem. The assignment problem is to make a pair problem for n as the employees and for n as the duties, therefore each employee gets one duty, and each duty is given exactly for each employee. The assignment problem can be solved by determining the matching in weighted bipartite graph through Hungarian Method. It can be determined from the alternating tree of a formed edge. If there is augmenting path, that augmenting path is used to form the more number of matching. If the formed path is alternating path, therefore the process is labeling the new node until finding the augmenting vertices. This matching is called as the perfect matching with the number of maximum weighed side in weighted bipartite graphs. The result matching is the solution for the assignment problem by giving an employee with a duty.</description><publisher lang="en-US">Universitas Muhammadiyah Surakarta</publisher><contributor lang="id-ID"/><date>2012-06-30</date><type>Journal:Article</type><type>Other:info:eu-repo/semantics/publishedVersion</type><type>Journal:Article</type><type>File:application/pdf</type><identifier>http://journals.ums.ac.id/index.php/jiti/article/view/984</identifier><source lang="en-US">Jurnal Ilmiah Teknik Industri; Vol. 11, No. 1, Juni 2012; 9 - 21</source><source lang="id-ID">Jurnal Ilmiah Teknik Industri; Vol. 11, No. 1, Juni 2012; 9 - 21</source><source>2460-4038</source><source>1412-6869</source><language>ind</language><relation>http://journals.ums.ac.id/index.php/jiti/article/view/984/678</relation><rights lang="en-US">Copyright (c) 2015 Jurnal Ilmiah Teknik Industri</rights><recordID>article-984</recordID></dc>
language ind
format Journal:Article
Journal
Other:info:eu-repo/semantics/publishedVersion
Other
File:application/pdf
File
Journal:eJournal
author Abrori, Muchammad
Wahyuningsih, Rina
title PENENTUAN MATCHING MAKSIMUM PADA GRAF BIPARTIT BERBOBOT MENGGUNAKAN METODE HUNGARIAN
publisher Universitas Muhammadiyah Surakarta
publishDate 2012
topic matching
graph
assignment problem
Hungarian method
url http://journals.ums.ac.id/index.php/jiti/article/view/984
http://journals.ums.ac.id/index.php/jiti/article/view/984/678
contents Matching is a part of graph theory that discuss to make a pair, that can be used to solve many problems; one of them is the assignment problem. The assignment problem is to make a pair problem for n as the employees and for n as the duties, therefore each employee gets one duty, and each duty is given exactly for each employee. The assignment problem can be solved by determining the matching in weighted bipartite graph through Hungarian Method. It can be determined from the alternating tree of a formed edge. If there is augmenting path, that augmenting path is used to form the more number of matching. If the formed path is alternating path, therefore the process is labeling the new node until finding the augmenting vertices. This matching is called as the perfect matching with the number of maximum weighed side in weighted bipartite graphs. The result matching is the solution for the assignment problem by giving an employee with a duty.
id IOS2738.article-984
institution Universitas Muhammadiyah Surakarta
institution_id 249
institution_type library:university
library
library Perpustakaan Universitas Muhammadiyah Surakarta
library_id 555
collection Jurnal Ilmiah Teknik Industri
repository_id 2738
subject_area Manajemen
Rekayasa
city KOTA SURAKARTA
province JAWA TENGAH
repoId IOS2738
first_indexed 2016-09-22T03:05:09Z
last_indexed 2016-09-22T03:05:09Z
recordtype dc
_version_ 1765813386239541248
score 17.538404