Theoretical Properties of the Network Simplex Method (Q4199852)
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: Theoretical Properties of the Network Simplex Method |
scientific article; zbMATH DE number 3641212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Theoretical Properties of the Network Simplex Method |
scientific article; zbMATH DE number 3641212 |
Statements
Theoretical Properties of the Network Simplex Method (English)
0 references
1979
0 references
cycling
0 references
stalling
0 references
worst-case computation bounds
0 references
computational complexity
0 references
pathological examples
0 references
network simplex method
0 references
minimum cost network flow problems
0 references
pivoting
0 references
spanning tree
0 references
strongly feasible trees
0 references
