An improved primal simplex variant for pure processing networks (Q4729253)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 4113871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved primal simplex variant for pure processing networks |
scientific article; zbMATH DE number 4113871 |
Statements
An improved primal simplex variant for pure processing networks (English)
0 references
1989
0 references
network problems
0 references
linear programming
0 references
numerical examples
0 references
simplex algorithm
0 references
primal partitioning algorithm
0 references
minimum-cost flow problems
0 references
0.8920915126800537
0 references
