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

From MaRDI portal
Revision as of 20:08, 26 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56581179, #quickstatements; #temporary_batch_1706294994303)
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

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references