Examples of max-flow and min-cut problems with duality gaps in continuous networks (Q1322557): Difference between revisions
From MaRDI portal
Latest revision as of 09:37, 30 July 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