On the equivalence of constrained and unconstrained flows (Q1339398): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 447 / rank | |||
Normal rank | |||
Revision as of 10:09, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the equivalence of constrained and unconstrained flows |
scientific article |
Statements
On the equivalence of constrained and unconstrained flows (English)
0 references
1 December 1994
0 references
The authors examine the problem of minimum-cost linear flow problem with a single side constraint. They give a linear-time algorithm for converting such a problem into a set of independent pure flow problems (without side constraints) and at most a single constrained flow problem. The problems are to be solved on subgraphs of the original graph and in that sense, the reduction is shown to be minimal.
0 references
minimum-cost linear flow
0 references
single side constraint
0 references
linear-time algorithm
0 references
