Static flows in networks

Results obtained over recent years in solving problems of uniform flows in networks are surveyed. Classification of problems and algorithms, theoretical results on cycling and stalling in direct simplex network algorithms, and ways to obtain the best, in a specified sense, dual algorithms are discussed. Methods are described in detail which lead to the maximal flow in the network and their relative efficiency in analyzed; some linear programming problems are reduced to problems of flows in networks.