A 400-meter relay includes four different swimmers who swim 100 meters on back, breast, butterfly and freestyle. A coach has 6 very fast swimmers whose expected time in seconds in the individual events are given in Table
How should the coach assigned to the relay swimmers to minimize the amount of his time?
The graph of this graph, each swimmer is related to each of the types tioned, which indicates that the graph is overpopulated, and the view has a lot of traffic, which does not help us solve nueestro
problem ...
would be something like, being the vertices of the inzquierda each swimmer, and the right of each type of swim y en las aristas iria indicado eltiempo que se tarda en llegar cada uno de ellos.
Segun el metodo hungaro, la mejor asignacion encontrada para resolver este problema de relevos, a manera de grafo seria la siguiente.
Como es evidente los nadadores con el numero 4 y 6,
se quedaron sin participar en el evento, pues sus tiempos no eran los ideales para soucionar el problema.
Clasificaciones de tipo de nado.
D= dorso
P= pecho
M= maripoza
L= libre
0 comments:
Post a Comment