A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741)

From MaRDI portal
Revision as of 18:58, 19 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
A polynomial time primal network simplex algorithm for minimum cost flows
scientific article

    Statements

    A polynomial time primal network simplex algorithm for minimum cost flows (English)
    0 references
    0 references
    25 November 1997
    0 references
    polynomial time primal network simplex algorithm
    0 references
    mininium cost flow
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references