Uniform flow distribution over the sink arcs in a network
type: Item
instance of: scholarly article
title: Uniform flow distribution over the sink arcs in a network
zbMATH Open document ID: 0648.90028
author: N. K. Belenova
published in: Automation and Remote Control
publication date: 1987-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 4059091
zbMATH Keywords: oriented network
zbMATH Keywords: maximum flow problems
zbMATH Keywords: subnetworks
zbMATH Keywords: partitioning
zbMATH Keywords: sequentially formed minimal cuts
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 4059091