Examples of max-flow and min-cut problems with duality gaps in continuous networks (Q1322557): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:14, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Examples of max-flow and min-cut problems with duality gaps in continuous networks |
scientific article |
Statements
Examples of max-flow and min-cut problems with duality gaps in continuous networks (English)
0 references
21 February 1995
0 references
duality gap
0 references
max-flow min-cut theorem
0 references
