The maximum flow problem in a network with special conditions of flow distribution

We consider the problem of finding a maximum flow in networks with strictly and nonstrictly determined flow distribution. We show that, for each condition of flow distribution, a solution to the problem under consideration exists and is unique. Some algorithms for finding a maximum flow are develope...

Full description

Saved in:
Bibliographic Details
Published in:Journal of applied and industrial mathematics 2015-07, Vol.9 (3), p.435-446
Main Authors: Skorokhodov, V. A., Chebotareva, A. S.
Format: Article
Language:English
Subjects:
Algorithms
Computer networks
Flow distribution
Graph algorithms
Mathematical analysis
Mathematics
Mathematics and Statistics
Networks
Studies
Traffic flow
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the problem of finding a maximum flow in networks with strictly and nonstrictly determined flow distribution. We show that, for each condition of flow distribution, a solution to the problem under consideration exists and is unique. Some algorithms for finding a maximum flow are developed for each condition of flow distribution. We find bounds for the maximum flow value in networks with strict flow distribution.
ISSN:1990-4789
1990-4797
DOI:10.1134/S199047891503014X