An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988)

From MaRDI portal
Revision as of 09:23, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
An improved branch and bound algorithm for minimum concave cost network flow problems
scientific article

    Statements

    An improved branch and bound algorithm for minimum concave cost network flow problems (English)
    0 references
    0 references
    13 October 1993
    0 references
    minimum concave cost network flow
    0 references
    branch and bound
    0 references
    simple bound improvement
    0 references
    0 references
    0 references
    0 references

    Identifiers