1. Shortest Path and Maximal Flow Problem (30%): You are given the following directed network.

a. (Shortest Path Problem 15%) Let the numbers on the arcs represent distances and find the shortest path from node 1 to node 9.

This is a shortest route problem. Following are the steps to follow.
1. Find the nearest node to the origin. Put the distance in a box by the node.
Nearest node to node 1 is node 2 at a distance of 3.

2. Find the next nearest node to the origin, and put the distance in a box by the node. In some cases, several paths will have to be checked to find the nearest ...

Solution Summary

This posting contains solution to following problems on Shortest Path and Maximal Flow technique.

... trying to route flows in this network, but simply identify the shortest connected path through the ... Ignore the maximum capacities of the links for this ...

... A. Shortest-route B. Maximal-flow C. Minimal-spanning tree ... technique is to A. Pick the node with the maximum flow. B. Pick any path with some flow C. Eliminate ...

...Path Flow 1-2-3-5 2 1-4-5 3 Total 5 Maximum flow=500 aircrafts ... 2. Find the shortest route from Node 1 to each of the other nodes in the transportation network ...

... manager wants to determine the best routes for the ... be solved using the a. shortest route solution ... spanning tree solution method c. maximal flow solution method ...

... Four Steps of the Maximal-Flow Technique 1. Pick any path... 3. Adjust the flow capacity numbers on the path. ... The shortest route technique finds how a person or ...

... This means that the maximum possible flow is 17 ... Routes 1 to 2, 1 to 3, 3 to 5, 2 to 6, 5 to ... to find a solution) 2. b) Provide a summary of the shortest times to ...

... Index Sort Name Description Time 1 1 Start Activity Start 0 Completion Time Due 22 Weeks 2 2 A Activity A 4 Max Delay 0 ... a. shortest time path through the ...

... feasible to consolidate these routes into fewer routes served by ... to school would exceed the state maximum of 45 ... of which would cover a much shorter route than ...