Examples of max-flow and min-cut problems with duality gaps in continuous networks (Q1322557): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01582067 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2128695783 / rank | |||
Normal rank | |||
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
