Abrori, Muchammad and Wardoyo, Retantyo (2009) Penyelesaian Matching Problem dengan Menggunakan Algoritma Arus Maksimal pada Sebuah Network. Kaunia Jurnal Sains dan Teknologi, 5 (1). pp. 1-15. ISSN 2301-8550
|
Text (Penyelesaian Matching Problem dengan Menggunakan Algoritma Arus Maksimal pada Sebuah Network)
Kaunia 2009_Matching Problem v2.pdf - Published Version Download (10MB) | Preview |
Abstract
A matching problem is a problem to match element in one set with elements in another set. Examples of matching application are placement of a new employees in order to meet with their qualifications, courses distribution based on the lecturers major, or matching a man so that he is able to marry a suitable woman, etc. These situations can be modeled by graphs. In this research, the matching is represented as a flow on a transportation network model. If the flow is maximum, then the matching will be maximum. So the research problem is how to solve a matching problem using a maximum flow algorithm on a network. From this research, it was obtained that: a) matching problem is a special case to final maximal flow algorithm on a network; b) in matching problem there is not any edge which is improperly oriented; c) the maximal flow algorithm should be able to help a manager in a firm or a company to make decisions especially regarding job distribution, employees position, selecting someone to represent the company, etc.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | matching, transportation network, maximal flow |
Subjects: | Sains |
Divisions: | Paper |
Depositing User: | Muchammad Abrori S.Si., M.Kom. |
Date Deposited: | 07 Jan 2020 13:43 |
Last Modified: | 07 Jan 2020 13:43 |
URI: | http://digilib.uin-suka.ac.id/id/eprint/37084 |
Share this knowledge with your friends :
Actions (login required)
View Item |