PENENTUAN MATCHING MAKSIMUM PADA GRAF BIPARTIT BERBOBOT MENGGUNAKAN METODE HUNGARIAN
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 giv...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Muhammadiyah University Press
2012-06-01
|
| Series: | Jurnal Ilmiah Teknik Industri |
| Subjects: | |
| Online Access: | http://journals.ums.ac.id/index.php/jiti/article/view/984 |