Relaxation Methods for Network Flow Problems with Convex Arc Costs (Q3783055)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Relaxation Methods for Network Flow Problems with Convex Arc Costs
scientific article

    Statements

    Relaxation Methods for Network Flow Problems with Convex Arc Costs (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    single commodity network flow
    0 references
    linear and strictly convex possibly nondifferentiable arc costs
    0 references
    dual Gauss-Seidel type relaxation method
    0 references
    parallel computation
    0 references
    linear minimum cost network flow
    0 references

    Identifiers