Efficient computational devices for the capacitated transportation problem

Authors:
Publisher website
Google Scholar
Abstract
This paper presents the details for applying and specializing the work of Ellis Johnson [10] and [11] to develop a primal code for the well‐known capacitated transportation problem. The code was developed directly from the work of Johnson, but is similar to codes developed by Glover, Karney, Klingman, and Napier [6] and Srinivasan and Thompson [14]. The emphasis in the presentation is the use of the graphical representation of the basis to carry out the revised simplex operations. This is a means of exploiting the special structure and sparseness of the constraint matrix to minimize computational effort and storage requirements. We also present the results of solving several large problems with the code developed.

This publication has 12 references indexed in Scilit: