Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
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.
scientific article; zbMATH DE number 3943554