A note on \(K\) best network flows (Q1897375)

From MaRDI portal
Revision as of 15:56, 23 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
A note on \(K\) best network flows
scientific article

    Statements

    A note on \(K\) best network flows (English)
    0 references
    0 references
    30 May 1996
    0 references
    linear integer network flow
    0 references
    polynomial time algorithm
    0 references
    multiple-criteria network flow
    0 references

    Identifiers