Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519)
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: Polynomial-time primal simplex algorithms for the minimum cost network flow problem |
scientific article; zbMATH DE number 64814
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time primal simplex algorithms for the minimum cost network flow problem |
scientific article; zbMATH DE number 64814 |
Statements
Polynomial-time primal simplex algorithms for the minimum cost network flow problem (English)
0 references
27 September 1992
0 references
polytope diameter
0 references
primal network simplex algorithm
0 references
minimum cost network flow problem
0 references
minimum mean augmenting cycle-cancelling method
0 references
cost- scaling
0 references
0 references
0 references
0 references
0 references
