Computing Maximal “Polymatroidal” Network Flows (Q3964296)

From MaRDI portal
Revision as of 00:43, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing Maximal “Polymatroidal” Network Flows
scientific article

    Statements

    Computing Maximal “Polymatroidal” Network Flows (English)
    0 references
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    constrained flows
    0 references
    polymatroidal network flow
    0 references
    capacities of sets of arcs
    0 references
    augmenting path theorem
    0 references
    integral flow theorem
    0 references
    max-flow min-cut theorem
    0 references
    maximal flow algorithm
    0 references
    0 references
    0 references
    0 references