Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587)
From MaRDI portal
scientific article; zbMATH DE number 751068
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly polynomial algorithm for two special minimum concave cost network flow problems |
scientific article; zbMATH DE number 751068 |
Statements
Strongly polynomial algorithm for two special minimum concave cost network flow problems (English)
0 references
6 August 1995
0 references
network flow problem
0 references
production-transportation problem
0 references
global optimization
0 references
concave minimization
0 references
strongly polynomial time algorithms
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0 references
