Diagnosing infeasibilities in network flow problems (Q1290604)

From MaRDI portal
Revision as of 20:24, 28 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
Diagnosing infeasibilities in network flow problems
scientific article

    Statements

    Diagnosing infeasibilities in network flow problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 September 1999
    0 references
    network flows
    0 references
    preflow-push algorithm
    0 references
    witness of infeasibility
    0 references
    feasible flow in a directed network
    0 references
    feasibility problem
    0 references
    maximum flow
    0 references
    minimum rooted cut problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references