Solving the Convex Cost Integer Dual Network Flow Problem (Q3114859)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Solving the Convex Cost Integer Dual Network Flow Problem
scientific article

    Statements

    Solving the Convex Cost Integer Dual Network Flow Problem (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2012
    0 references
    minimum cost
    0 references
    flow convex cost
    0 references
    flow Lagrangian
    0 references
    scaling algorithm
    0 references
    duality theory
    0 references
    integer programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references