The maximal flow problem on networks with special conditions of flow distribution

We consider the problem of finding the maximal flow in nets with conditions of strict and nonstrict flow distribution. We show that for each condition of flow distribution the solution of the considered problem exists and is unique. The algorithms for finding the maximal flow are developed for each condition of flow distribution. We find bounds on the maximal flow value in the case of strict flow distribution. Ill. 3, tab. 4, bibliogr. 11.