Relaxation Methods for Network Flow Problems with Convex Arc Costs (Q3783055): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/0325067 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035934281 / rank
 
Normal rank

Latest revision as of 01:56, 20 March 2024

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