Examples of max-flow and min-cut problems with duality gaps in continuous networks (Q1322557)

From MaRDI portal
Revision as of 20:28, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    21 February 1995
    0 references
    0 references
    duality gap
    0 references
    max-flow min-cut theorem
    0 references