Finding minimum-cost circulations by canceling negative cycles (Q3474897)

From MaRDI portal
Revision as of 05:10, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jacm/GoldbergT89, #quickstatements; #temporary_batch_1731468600454)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding minimum-cost circulations by canceling negative cycles
scientific article

    Statements

    Finding minimum-cost circulations by canceling negative cycles (English)
    0 references
    0 references
    0 references
    1989
    0 references
    network problems
    0 references
    cycle cancelling
    0 references
    minimum-cost flow
    0 references
    network optimization
    0 references
    transportation problem
    0 references
    transshipment problem
    0 references
    dynamic trees
    0 references

    Identifiers