Abstract
The classical transportation problem as formulated by F. L. Hitchcock in 1941 reads as follows:
-
Given m producers X 1,...,X m of an article, with X i being capable of producing a(X i ) = a i ≧ 0.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Busacker, R. G., and P. J. Gowen: A Procedure for Determining a Family of Minimal-Cost Network Flow Patterns, ORO Techn. Report 15, Operations Res. Office, Johns Hopkins Univ., Baltimore 1961.
Busacker, R. G., and T. L. Saaty: Finite Graphs and Networks, An Introduction with Applications, New York 1965 (German: Munich/Vienna 1968; Russian: Moscow 1974).
Ford, L. R., and D. R. Fulkerson: Flows in Networks, Princeton, N.J., 1962 (Russian: Moscow 1966).
Hu, T. C.: Integer Programming and Network Flows, Reading, Mass., 1970 (German: Munich/Vienna 1972; Russian: Moscow 1974).
Klein, M.: A primal method for minimal cost flows, Management Sci. 14 (1967), 205 to 220.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 VEB Deutscher Verlag der Wissenschaften, Berlin
About this chapter
Cite this chapter
Walther, H. (1984). The linear transportation problem. In: Ten Applications of Graph Theory. Mathematics and Its Applications, vol 7. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7154-7_3
Download citation
DOI: https://doi.org/10.1007/978-94-009-7154-7_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7156-1
Online ISBN: 978-94-009-7154-7
eBook Packages: Springer Book Archive