Approximating reduced costs under degeneracy in a network flow problem with side constraints (Q5689761)

From MaRDI portal
Revision as of 09:46, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 961879
Language Label Description Also known as
English
Approximating reduced costs under degeneracy in a network flow problem with side constraints
scientific article; zbMATH DE number 961879

    Statements

    0 references
    7 January 1997
    0 references
    optimal simplex tableau
    0 references
    degeneracy
    0 references
    network flow problems with side constraints
    0 references
    Lagrangian relaxation
    0 references
    minimum-cost network flow algorithm
    0 references
    shortest path algorithm
    0 references
    Approximating reduced costs under degeneracy in a network flow problem with side constraints (English)
    0 references

    Identifiers