to better understand, can you send an small example with a solution?
On 3/28/07, vinay [EMAIL PROTECTED] wrote:
Hai all,
Given a N X N Matrix( with +ve integers), How to find the elements,
such that only one element from each row and one element from each
column and sum of the elements is
Is it not Travelling Sales Person problem ???
I think we do the same for Travelling Sales Person algorithm also...
On Mar 28, 6:55 pm, Guillermo Garcia [EMAIL PROTECTED] wrote:
to better understand, can you send an small example with a solution?
On 3/28/07, vinay [EMAIL PROTECTED] wrote:
The example given by Atamurad suits my need..
On Mar 28, 4:09 pm, vinay [EMAIL PROTECTED] wrote:
Hai all,
Given a N X N Matrix( with +ve integers), How to find the elements,
such that only one element from each row and one element from each
column and sum of the elements is minimum.
Thanks
http://en.wikipedia.org/wiki/Assignment_problem
http://en.wikipedia.org/wiki/Hungarian_algorithm
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
This looks like the classic Assignment problem to me do look up
on this topic and I'm sure you'll come across a few good algos.
Initially, it seems that it'll be an O(n^3) problem but maybe you
can better it !!
--~--~-~--~~~---~--~~
You received this
