Examples of max-flow and min-cut problems with duality gaps in continuous networks (Q1322557)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Examples of max-flow and min-cut problems with duality gaps in continuous networks |
scientific article; zbMATH DE number 563261
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Examples of max-flow and min-cut problems with duality gaps in continuous networks |
scientific article; zbMATH DE number 563261 |
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
