On the use of tree-indexing methods in transportation algorithms

Abstract The paper describes how to use the triple index and the threaded index for storing the basis-tree when applying the primal, dual or primal-dual simplex algorithm to solve a classical transportation model. The experience reported in the references suggests that the algorithms thus obtained are among the most efficient to-day. Detailed algorithms are given in order to facilitate computer-implementation.