Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (Q1072935)
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: Computational experience with a polynomial-time dual simplex algorithm for the transportation problem |
scientific article; zbMATH DE number 3943554
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational experience with a polynomial-time dual simplex algorithm for the transportation problem |
scientific article; zbMATH DE number 3943554 |
Statements
Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (English)
0 references
1986
0 references
This paper reports on the implementation and computational experience obtained with a polynomial-time dual simplex algorithm for the transportation problem. The polynomial-time version of the algorithm is shown to be empirically, as well as theoretically, more efficient than a standard version. In particular, scaling of the supplies and demands is very effective computationally.
0 references
implementation
0 references
computational experience
0 references
polynomial-time dual simplex algorithm
0 references
transportation problem
0 references
scaling of the supplies and demands
0 references
0 references
0 references
