On strongly polynomial dual simplex algorithms for the maximum flow problem (Q1373745)
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: On strongly polynomial dual simplex algorithms for the maximum flow problem |
scientific article; zbMATH DE number 1091307
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On strongly polynomial dual simplex algorithms for the maximum flow problem |
scientific article; zbMATH DE number 1091307 |
Statements
On strongly polynomial dual simplex algorithms for the maximum flow problem (English)
0 references
11 June 1998
0 references
dual network simplex algorithm
0 references
preflow
0 references
pseudoaugmenting path
0 references
parametric maximum flow problems
0 references
0 references
0 references
