Next: Transportation Problem Up: A Tutorial on Network Previous: Maximum Flow

Other Network Models

So far we have considered three network models: shortest path, minimum spanning tree, and maximum flow, and you have learned some algorithms to solve these problems. The purpose of learning these algorithms is twofold: to impress upon you the simplicity of the algorithms, and to allow you to solve smallish examples quickly and accurately.

We will now move on to some more complicated models. These models can all be solved very effectively by specializing the simplex method for them. It is important for you to know how to model within the restrictions required by each model. The models we will look at are the transportation, assignment, transshipment and minimum cost flow models. (corresponding to sections 7-1 and 7-5, 7-6, and 8-5 in the text)