A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087)

From MaRDI portal
Revision as of 20:18, 24 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 dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
scientific article

    Statements

    A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (English)
    0 references
    13 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    network flows
    0 references
    dynamic programming
    0 references
    concave-cost optimization
    0 references
    global optimization
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references