A polynomial-time simplex method for the maximum \(k\)-flow problem (Q688924)
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: A polynomial-time simplex method for the maximum k-flow problem |
scientific article; zbMATH DE number 438795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time simplex method for the maximum \(k\)-flow problem |
scientific article; zbMATH DE number 438795 |
Statements
A polynomial-time simplex method for the maximum \(k\)-flow problem (English)
0 references
1 November 1993
0 references
polynomial time
0 references
circulation problem
0 references
network simplex method
0 references
0 references
0 references
0.8435240387916565
0 references
0.8419652581214905
0 references
0.8408209085464478
0 references
0.8361204266548157
0 references
0.8343218564987183
0 references
