Hi, i hope you can help me with this problem?
A coach is putting a relay team together for a 400-meter relay.
Each swimmer must swim 100 meters of breaststroke, backstroke,
butterfly, or freestyle.
!There are at least four swimmers
Is there a algorithm to find the optimum solution to minimize the
team's time?
(similar to dynamic programming solution for knapsack problem!)
for example(5 swimmers):
1 2 3 4
1 30 34 26 29
2 31 37 31 36
3 32 29 41 40
4 29 40 37 31
5 33 32 35 24
first i thought i can solve this problem with the hungarian algorithm,
but that's out of the question..
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
