- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Employing Kruskal's method for assignment problem | ||
| IRAQI JOURNAL OF STATISTICAL SCIENCES | ||
| Article 8, Volume 8, Issue 1, 2008, Pages 57-70 PDF (0 K) | ||
| DOI: 10.33899/iqjoss.2008.031548 | ||
| Abstract | ||
| The Assignment problem is really considered really very important, which assigns a set of n distinct jobs to n machines such that, the total cost is minimum. The problem is solved by many methods, one of them is the Hungarian's method. This research deals with graphs by proposing a new method which deals with complete bipartite graph using Kruskal's method. We compare the results for different problems which give optimal solution in both methods, but the new method gives a high degree of success and its easy to use. | ||
|
Statistics Article View: 302 PDF Download: 317 |
||