Solving integer minimum cost flows with separable convex cost objective polynomially (Q3716775)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving integer minimum cost flows with separable convex cost objective polynomially |
scientific article |
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
