• Login
    View Item 
    •   Home
    • Terbitan Berkala Ilmiah (Journal)
    • Jurnal Ilmiah Teknik Industri
    • Volume 11, No.1, Juni 2012
    • View Item
    •   Home
    • Terbitan Berkala Ilmiah (Journal)
    • Jurnal Ilmiah Teknik Industri
    • Volume 11, No.1, Juni 2012
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    PENENTUAN MATCHING MAKSIMUM PADA GRAF BIPARTIT BERBOBOT MENGGUNAKAN METODE HUNGARIAN

    Thumbnail
    View/Open
    JITI-11-02-Abrori-OK.pdf (138.5Kb)
    Date
    2012-06
    Author
    Abrori, Muchammad
    Wahyuningsih, Rina
    Metadata
    Show full item record
    Abstract
    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.
    URI
    http://hdl.handle.net/11617/2146
    Collections
    • Volume 11, No.1, Juni 2012

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    Publikasi IlmiahCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV