Minimum cost flow with set-constraints (Q3936464)

From MaRDI portal
Revision as of 00:21, 22 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimum cost flow with set-constraints
scientific article

    Statements

    Minimum cost flow with set-constraints (English)
    0 references
    0 references
    0 references
    1982
    0 references
    minimum cost network flow
    0 references
    set-constraints
    0 references
    polymatroid intersection problem
    0 references
    algorithm
    0 references
    dual problem
    0 references
    supermodular functions
    0 references
    decomposition
    0 references
    submodular function
    0 references
    0 references

    Identifiers