Uniform flow distribution over the sink arcs in a network
It is required to find a flow from the source to the sink in an oriented network such that it has a given value and minimizes the mean-square deviation of the weighted flows on the sink arcs. An algorithm is proposed for constructing the sought flow, which requires solving a finite number of maximum flow problems in the subnetworks obtained by partitioning the original network by sequentially formed minimal cuts. The number of such subproblems does not exceed twice the number of sink arcs in the network.
scientific article; zbMATH DE number 4059091