A strongly polynomial minimum cost circulation algorithm (Q1079110)
From MaRDI portal
!
WARNING
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 3961309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strongly polynomial minimum cost circulation algorithm |
scientific article; zbMATH DE number 3961309 |
Statements
A strongly polynomial minimum cost circulation algorithm (English)
0 references
1985
0 references
minimum cost circulation
0 references
strongly polynomial
0 references
0.895029604434967
0 references
0.8948834538459778
0 references
0.8791441321372986
0 references
