Parametric maximal flows in generalized networks – complexity and algorithms (Q3813580)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Parametric maximal flows in generalized networks – complexity and algorithms
scientific article

    Statements

    Parametric maximal flows in generalized networks – complexity and algorithms (English)
    0 references
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    parametric maximal flows
    0 references
    networks with gains
    0 references
    breakpoints
    0 references
    worst-case analysis
    0 references
    horizontal approximation method
    0 references
    0 references