Strong polynomial-time solvability of a minimum concave cost network flow problem. (Q1582279)
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 1513022
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong polynomial-time solvability of a minimum concave cost network flow problem. |
scientific article; zbMATH DE number 1513022 |
Statements
Strong polynomial-time solvability of a minimum concave cost network flow problem. (English)
0 references
2000
0 references
0.9135045409202576
0 references
0.8840667009353638
0 references
0.877927303314209
0 references
0.8685532212257385
0 references
0.8681625127792358
0 references
