Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795)

From MaRDI portal
Revision as of 12:05, 17 May 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
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
scientific article

    Statements

    Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (English)
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    network flow
    0 references
    dual algorithm
    0 references
    polynomial algorithms
    0 references
    minimum cost circulation problem
    0 references
    0 references