Relaxation Methods for Network Flow Problems with Convex Arc Costs (Q3783055)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4045459
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relaxation Methods for Network Flow Problems with Convex Arc Costs |
scientific article; zbMATH DE number 4045459 |
Statements
Relaxation Methods for Network Flow Problems with Convex Arc Costs (English)
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
0.8757047653198242
0 references
0.8741487860679626
0 references
0.8741487860679626
0 references
0.8723365664482117
0 references
0.8672255277633667
0 references
