Solving integer minimum cost flows with separable convex cost objective polynomially (Q3716775)
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 3945844
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving integer minimum cost flows with separable convex cost objective polynomially |
scientific article; zbMATH DE number 3945844 |
Statements
Solving integer minimum cost flows with separable convex cost objective polynomially (English)
0 references
1986
0 references
nonlinear network flows
0 references
polynomial algorithm
0 references
minimum cost network flow
0 references
separable convex cost functions on the arcs
0 references
integrality restrictons on the flows
0 references
scaling approach
0 references
out-of-kilter method
0 references
0.9352003
0 references
0.9315948
0 references
0.9067635
0 references
0.89317214
0 references
0.8922549
0 references
0.8901117
0 references
0.8843443
0 references
0.8834333
0 references
0.88272977
0 references
