Equivalence of the primal and dual simplex algorithms for the maximum flow problem (Q1362513)
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: Equivalence of the primal and dual simplex algorithms for the maximum flow problem |
scientific article; zbMATH DE number 1043993
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence of the primal and dual simplex algorithms for the maximum flow problem |
scientific article; zbMATH DE number 1043993 |
Statements
Equivalence of the primal and dual simplex algorithms for the maximum flow problem (English)
0 references
5 August 1997
0 references
primal and dual simplex algorithms
0 references
maximum flow
0 references
0 references
