www.ams.jhu.edu/~castello/362/Handouts/*hungarian*.pdf
This PDF might be helpful
On Sunday, 16 September 2012 16:42:25 UTC+5:30, Rahul Kumar Patle wrote:
>
> @atul: in Hungarian Algorithms works for minimization of cost where the
> terminating condition is based on zeros.. in my problem what va
typo error :-
mat[ i ] [ j ] to -ve sign and make mat[ i ][ i ]=INT_MAX
On Mon, Sep 17, 2012 at 9:43 AM, atul anand wrote:
> make all mat[i][j] to -ve sign and make mat[i][j]=INT_MAX
> now i guess same algo will work..no changes required.
>
>
> On Sun, Sep 16, 2012 at 4:42 PM, Rahul Kumar Patle
make all mat[i][j] to -ve sign and make mat[i][j]=INT_MAX
now i guess same algo will work..no changes required.
On Sun, Sep 16, 2012 at 4:42 PM, Rahul Kumar Patle <
patlerahulku...@gmail.com> wrote:
> @atul: in Hungarian Algorithms works for minimization of cost where the
> terminating condition
@atul: in Hungarian Algorithms works for minimization of cost where the
terminating condition is based on zeros.. in my problem what value i will
have to consider as base/terminating values because there may not be same
values in coloumn and rows..
second thing you use subtraction there, here will
@tushar :- correct...
On Sun, Sep 16, 2012 at 12:59 PM, Tushar wrote:
> we can assign minimum possible value, like negative infinity to the
> diagonal elements.
> Then they would not be considered for maximizing the sum.
>
> --
> You received this message because you are subscribed to the Googl
we can assign minimum possible value, like negative infinity to the
diagonal elements.
Then they would not be considered for maximizing the sum.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https:
@atul
agreed with u dat it can be solved through hungarian method.. but what
about the condition a[i][i] entry is invalid
if all elements lie on diagonal n d sum is also maximum den a[i][i]
condition will be violated but Hungarian method still works
--
You received this message because you are s
typo error :-
and each *row* *as cost
On Sun, Sep 16, 2012 at 12:44 AM, atul anand wrote:
> correct me if i am wrong ,
> it seems similar to Hungarian algorithm.
> here each column can be considered as persons P(p0,p1,p2,..pn) and each as
> cost of job say X(x0,x1,x2,x3,x4xn).
> Hungarian al
correct me if i am wrong ,
it seems similar to Hungarian algorithm.
here each column can be considered as persons P(p0,p1,p2,..pn) and each as
cost of job say X(x0,x1,x2,x3,x4xn).
Hungarian algorithm tells how to find minimal but here its maximal...so i
guess changes in the algo will give the
