A measure-theoretical max-flow-min-cut problem (Q583082): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3770273 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3714302 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3292914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5595961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3673434 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3318497 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Measure theoretic versions of linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Class of Continuous Network Flow Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topology and measure / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5580899 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2011918905 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:48, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A measure-theoretical max-flow-min-cut problem |
scientific article |
Statements
A measure-theoretical max-flow-min-cut problem (English)
0 references
1990
0 references
We investigate a measure-theoretical generalization of the famous max- flow-min-cut Theorem of Ford/Fulkerson for networks to continuous flows in bounded regions in the plane. A flow is a measure on the set of all rectifiable Jordan curves ``from the left to the right'' that satisfies a certain capacity condition. The value of a flow is its total measure. We prove that the duality \(\max\)- flow\(=\min\)-cut holds, if a cut is defined as a rectifiable Jordan curve ``from the bottom to the top'' and the value of such a cut is the arc length of the curve weighted by the capacity.
0 references
max-flow-min-cut
0 references
continuous flows in bounded regions
0 references
rectifiable Jordan curves
0 references