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.
The article was added to IASJ on 2012-05-23
3144 Total full text downloads since the date of addition
Year |
Total |
Jan |
Feb |
Mar |
Apr |
May |
Jun |
Jul |
Aug |
Sep |
Oct |
Nov |
Dec |
2024 |
6 |
4 |
2 |
|
|
|
|
|
|
|
|
|
|
2023 |
12 |
2 |
|
|
1 |
|
1 |
1 |
|
2 |
1 |
1 |
3 |
2022 |
24 |
|
1 |
5 |
1 |
2 |
4 |
2 |
5 |
2 |
|
2 |
|
2021 |
32 |
5 |
4 |
|
|
4 |
11 |
|
|
1 |
2 |
1 |
4 |
2020 |
250 |
22 |
13 |
6 |
11 |
11 |
101 |
47 |
9 |
12 |
1 |
5 |
12 |
2019 |
133 |
6 |
14 |
14 |
10 |
7 |
13 |
4 |
3 |
8 |
19 |
14 |
21 |
2018 |
221 |
28 |
16 |
12 |
23 |
31 |
15 |
9 |
10 |
9 |
16 |
21 |
31 |
2017 |
273 |
37 |
19 |
22 |
25 |
40 |
11 |
6 |
14 |
16 |
27 |
19 |
37 |
2016 |
293 |
1 |
|
39 |
41 |
40 |
20 |
10 |
11 |
6 |
18 |
26 |
81 |
2015 |
658 |
100 |
34 |
73 |
91 |
61 |
47 |
58 |
22 |
16 |
31 |
56 |
69 |
2014 |
696 |
74 |
32 |
120 |
55 |
91 |
82 |
18 |
22 |
22 |
23 |
73 |
84 |
2013 |
421 |
21 |
21 |
33 |
43 |
36 |
32 |
19 |
18 |
28 |
22 |
62 |
86 |
2012 |
125 |
|
|
|
|
|
1 |
14 |
5 |
9 |
8 |
21 |
67 |
Usage is updated on a monthly basis.