A computational comparison of the network simplex method with the dual affine scaling method (Q806669): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1885770 |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / author | |||
Property / author: Andrew P. Armacost / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 02:17, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A computational comparison of the network simplex method with the dual affine scaling method |
scientific article |
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