Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks. (Q5929388)
From MaRDI portal
scientific article; zbMATH DE number 1584983
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks. |
scientific article; zbMATH DE number 1584983 |
Statements
Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks. (English)
0 references
14 June 2001
0 references
Uncapacitated single-source acyclic networks
0 references
Concave costs
0 references
Dynamic programming
0 references
Linear approximation
0 references
Convergence
0 references
