Strongly polynomial time algorithms for certain concave minimization problems on networks (Q1317011)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strongly polynomial time algorithms for certain concave minimization problems on networks |
scientific article; zbMATH DE number 527400
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly polynomial time algorithms for certain concave minimization problems on networks |
scientific article; zbMATH DE number 527400 |
Statements
Strongly polynomial time algorithms for certain concave minimization problems on networks (English)
0 references
17 April 1994
0 references
strongly polynomial algorithm
0 references
parametric method
0 references
production- transportation problem
0 references
minimum concave cost flow problem
0 references
single source uncapacitated network
0 references
0 references
0 references
0 references
