Since 1970 we have been jointly working with systems analysts in order to develop new techniques which are computationally efficient for solving network problems. Our first step in this direction was to elaborate on Johnson's "triple-label method" 9 by providing a method for characterizing successive basis trees with minimal relabeling. This procedure, which is called the augmented predecessor index (API) method 5, additionally indicates the most efficient way to co-ordinate the activities of finding the representation of the come-in arc (basis equivalent path), pricing-out the basis, and updating the basis labels. The API method has been a major contributor to the improvements in the computational efficiency of solution algorithms. Its use was a factor underlying the efficiency attained by the special purpose primal simplex transportation code of Glover, Karney, and Klingman 6. In addition, the procedure was incorporated into the Srinivasan -- Thompson accelerated primal transportation code 14 and succeeded in cutting the solution times of that algorithm by more than half.
/lp/association-for-computing-machinery/code-development-and-computation-testing-on-network-problems-rEPjzzxDjx