Many assignment (and related) problems can be translated to a network flow problem. The final module presents this network model and an efficient (augmenting path) algorithm for find maximum flows in such a network. Next, two extensions (circulations with supply and demands, lower bounds on the capacity) are presented, and a number of example problems and their translations to the network flow model show the wide range of applications of this single algorithm.

Back to top