A computational comparison of the network simplex method with the dual affine scaling method (Q806669)
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: A computational comparison of the network simplex method with the dual affine scaling method |
scientific article; zbMATH DE number 4207220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational comparison of the network simplex method with the dual affine scaling method |
scientific article; zbMATH DE number 4207220 |
Statements
A computational comparison of the network simplex method with the dual affine scaling method (English)
0 references
1991
0 references
dual affine scaling method
0 references
complete Cholesky factors
0 references
network simplex method
0 references
minimum cost network flow
0 references
transportation
0 references
assignment
0 references
0.840749204158783
0 references
0.8223033547401428
0 references
