Polynomial dual network simplex algorithms (Q689130)

From MaRDI portal
Revision as of 08:49, 4 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Polynomial dual network simplex algorithms
scientific article

    Statements

    Polynomial dual network simplex algorithms (English)
    0 references
    0 references
    0 references
    0 references
    6 December 1993
    0 references
    minimum cost network flows
    0 references
    strongly polynomial capacity scaling algorithms
    0 references
    transshipment problem
    0 references
    polynomial dual network simplex pivot rule
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references