On Gale's feasibility theorem for certain infinite networks (Q1323136): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Vincentiu Dumitru / rank | |||
Property / reviewed by | |||
Property / reviewed by: Vincentiu Dumitru / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3935671 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A theorem on flows in networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3039935 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3670041 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremum problems on an infinite network / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:44, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Gale's feasibility theorem for certain infinite networks |
scientific article |
Statements
On Gale's feasibility theorem for certain infinite networks (English)
0 references
9 May 1994
0 references
The authors extend Gale's feasibility theorem to infinite, but locally finite networks. The result is different from the extensions of Fuchssteiner and Lusky or from that of Neumann, either by relaxing hypotheses or by the fact that the obtained flows are functions, not measures. Lemma 2, the central part of the paper, that gives conditions for a feasible flow bounded from below by zero, seems to be new, even in the case of a finite network. As an application of their result the authors prove a generalization of the max-flow min-cut theorem of Ford and Fulkerson.
0 references
infinite networks
0 references
Gale's feasibility theorem
0 references
locally finite networks
0 references
max-flow min-cut theorem
0 references