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

From MaRDI portal
Revision as of 03:56, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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