The Hesse-Woolsey-Stern Algorithm for the Transportation Problem: An Explication

R. Bharath
Additional contact information
R. Bharath: Management and Marketing Department, Northern Michigan University, Marquette, Michigan 49855

Interfaces, 1982, vol. 12, issue 4, 67-68

Abstract: Hesse and Woolsey [Hesse, Rick, Gene Woolsey. 1980. Applied Management Science: A Quick and Dirty Approach . SRA, Chicago, 177.], following Stern [Stern, M. E. 1963. Mathematics for Management . Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 396--400.], present an attractive way of modifying the Hungarian method for assignment problems so as to apply it to transportation problems in general. Their method consists in reducing the costs matrix by row and column reductions so as to identify the cells with zero relative/opportunity cost, and if necessary generating more zeros at later stages (by using the method of finding the smallest element not covered by a line when covering the zeros by using the minimum number of lines). It is shown here that it is not a sufficient condition for making an all-zero-cost allocation.

Keywords: transportation; mathematics; matrices (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/inte.12.4.67 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orinte:v:12:y:1982:i:4:p:67-68

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().