Finding minimum-cost flows by double scaling (Q1184348)

From MaRDI portal
Revision as of 10:53, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding minimum-cost flows by double scaling
scientific article

    Statements

    Finding minimum-cost flows by double scaling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    transportation
    0 references
    minimum-cost circulations
    0 references
    minimum-cost flow problem
    0 references
    capacity-scaling
    0 references
    excess-scaling
    0 references
    dynamic tree data structure
    0 references
    cost- scaling
    0 references
    0 references
    0 references