Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475)

From MaRDI portal
Revision as of 09:26, 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
Tight bounds on the number of minimum-mean cycle cancellations and related results
scientific article

    Statements

    Tight bounds on the number of minimum-mean cycle cancellations and related results (English)
    0 references
    0 references
    0 references
    0 references
    11 September 1994
    0 references
    network flow problem
    0 references
    minimum cost flow
    0 references
    minimum cost circulation
    0 references
    combinatorial optimization
    0 references
    cycle cancelling algorithms
    0 references
    strongly polynomial algorithms
    0 references
    minimum-mean cycle-cancelling algorithm
    0 references
    maximum- mean cut canceling algorithm
    0 references
    dual algorithm
    0 references

    Identifiers

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