Static flows in networks (Q1100084)

We survey the results obtained in recent years in connection with problems of homogeneous flows in networks. We consider the classification of problems and algorithms, the theoretical results on cycling and stalling in primal simplex network algorithms, and methods of construction of dual algorithms that are optimal in a certain sense. Construction of maximum flows in networks is described in detail and the comparative efficiency of the corresponding methods is analyzed. Reduction of some linear programming problems to network flow problems is discussed.