Uniform flow distribution among drain arcs of the network

In a directed network it is required to find a source-drain flow of specified strength which would minimize the r. m. s. deflection of weighted flows in drain arcs. An algorithm is proposed for obtaining the desired flow whereby a finite number of problems are solved of the maximal flow in the subnetworks into which the original network is divided by minimal cross-sections which are obtained successively. The number of such problems does not exceed the doubled number of drain arcs in the network.