Implementation of a steepest-edge primal-dual simplex method for network linear programs (Q1265887)
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: Implementation of a steepest-edge primal-dual simplex method for network linear programs |
scientific article; zbMATH DE number 1202743
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implementation of a steepest-edge primal-dual simplex method for network linear programs |
scientific article; zbMATH DE number 1202743 |
Statements
Implementation of a steepest-edge primal-dual simplex method for network linear programs (English)
0 references
1998
0 references
network flow problem
0 references
computational methods
0 references
primal-dual simplex variant
0 references
generalized network problem
0 references
uncapacitated transportation
0 references
transshipment
0 references
