The Student Room Group

Allocation

In the Hungarian algorithm, what is the easiest way to find a matching?
For example the array that has 5 crossed lines, what is the easiest ways to match these 0's?
image.jpg
Original post by Zenarthra
In the Hungarian algorithm, what is the easiest way to find a matching?
For example the array that has 5 crossed lines, what is the easiest ways to match these 0's?
image.jpg


Are you asking how to get the answer shown in part c?
Reply 2
Original post by georgecook174
Are you asking how to get the answer shown in part c?


Yes but all of them?
I can get one of the answers but can't get then all.
And what is the quickest way to them answers?
So of course you need to match up with the 0's but some you can't match, so hats the quickest way to find a full matching?
(edited 8 years ago)
Original post by Zenarthra
Yes but all of them?
I can get one of the answers but can't get then all.
And what is the quickest way to them answers?
So of course you need to match up with the 0's but some you can't match, so hats the quickest way to find a full matching?


Well you know each person has to be assigned to one task. The "0" represent the optimum allocations. For that example you knew W had to do C as that is W's only 0. Then as C has been assigned you know that X must do A and thats the only one left to it. And then V, Y, Z have a couple of variations. Does that answer it?

Quick Reply

Latest