How to compute least infeasible flows (Q1373747)

From MaRDI portal
Revision as of 20:18, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
How to compute least infeasible flows
scientific article

    Statements

    title
    How to compute least infeasible flows (English)
    0 references
    DOI
    10.1007/BF02614370
    0 references
    publication date
    25 November 1997
    0 references
    zbMATH DE Number
    1091309
    0 references
    zbMATH Keywords
    least infeasible flows
    0 references
    dual cut canceling min-cost flow network algorithms
    0 references
    cites work
    Q3056948
    0 references
    On a routing problem
    0 references
    Q3274170
    0 references
    Q4763405
    0 references
    Q2743974
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1373747&oldid=34193108"
    Powered by MediaWiki