On strongly polynomial dual simplex algorithms for the maximum flow problem (Q1373745)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On strongly polynomial dual simplex algorithms for the maximum flow problem |
scientific article |
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
