Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972)
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: Two strongly polynomial cut cancelling algorithms for minimum cost network flow |
scientific article; zbMATH DE number 446809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two strongly polynomial cut cancelling algorithms for minimum cost network flow |
scientific article; zbMATH DE number 446809 |
Statements
Two strongly polynomial cut cancelling algorithms for minimum cost network flow (English)
0 references
2 January 1994
0 references
strongly polynomial algorithms
0 references
minimum cost network flow
0 references
0 references
0 references
0 references
0 references
0 references
0.912497580051422
0 references
0.9040272831916808
0 references
0.9040272831916808
0 references
0.8905613422393799
0 references
0.8905608057975769
0 references
