A parametric algorithm for convex cost network flow and related problems (Q789313)

From MaRDI portal
Revision as of 10:57, 14 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A parametric algorithm for convex cost network flow and related problems
scientific article

    Statements

    A parametric algorithm for convex cost network flow and related problems (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    computational complexity
    0 references
    polynomial boundedness
    0 references
    computational results
    0 references
    context cost network flow problem
    0 references
    minimum cost flow
    0 references
    parametric algorithm
    0 references
    optimum basis structure
    0 references
    shortest paths
    0 references
    large size problems
    0 references
    project cost curve
    0 references
    CPM network
    0 references
    optimum capacity expansion
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references