Obtain a network, and use
the same network to illustrate the shortest path problem for communication
networks, the max flow problem, the minimum cost flow problem, and the
multicommodity flow problem. This
will be a very efficient way of introducing the four problems. (Perhaps under 10 minutes of class time.) |