Uniform flow distribution over the sink arcs in a network (Q1105479)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Uniform flow distribution over the sink arcs in a network |
scientific article; zbMATH DE number 4059091
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uniform flow distribution over the sink arcs in a network |
scientific article; zbMATH DE number 4059091 |
Statements
Uniform flow distribution over the sink arcs in a network (English)
0 references
1987
0 references
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.
0 references
oriented network
0 references
maximum flow problems
0 references
subnetworks
0 references
partitioning
0 references
sequentially formed minimal cuts
0 references
