A High-Speed Computer Technique for the Transportation Problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A High-Speed Computer Technique for the Transportation Problem

Full text

Pdf (819 KB)

Source

Journal of the ACM (JACM) archive
Volume 5 , Issue 2 (April 1958) table of contents

Pages: 132 - 153

Year of Publication: 1958

ISSN:0004-5411

Author

Jack B. Dennis

Massachusetts Institute of Technology, Cambridge, Mass.

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 38, Citation Count: 9

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/320924.320927 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	G. B. DANTZ}{G, Maximization of a Linear Function of Variables Subject to Linear Inequalities, Acli~ity Analysis of Production and Allocation, T. C. Koopmans, Ed., John Wiley and Sons, New York, (1951), pp. 339-347.
	2	A. CHAR~ES, AND W. W. COOP~-R, The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems, Management Science t (1954), 49-69.
	3	G. B. D.(NTZIC, Application of the Simplex Method to a Transportation Problem, Activity Analysis of Production and Allocation, T. C. Koopmans, Ed., John Wiley & Sons, New York, (1951), pp. 359-373.
	4	L. R. FOND, Ja., AND D. R. FULKERSON, Solving the Transportation Prot)lem, Report P-895, The Rand Corporation, Santa Moniea, California, June 1956.

CITED BY 9

	V. Srinivasan , G. L. Thompson, Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems, Journal of the ACM (JACM), v.19 n.4, p.712-726, Oct. 1972
	V. Srinivasan , G. L. Thompson, Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm, Journal of the ACM (JACM), v.20 n.2, p.194-213, April 1973
	R. Totschek , R. C. Wood, An Investigation of Real-Time Solution of the Transportation Problem, Journal of the ACM (JACM), v.8 n.2, p.230-239, April 1961
	William W. White, A Status Report on Computing Algorithms for Mathematical Programming, ACM Computing Surveys (CSUR), v.5 n.3, p.135-166, Sept. 1973
	Janice R. Lourie, The computation of connected regions in interactive graphics, Proceedings of the 1969 24th national conference, p.369-377, August 26-28, 1969
	P. S. Dwyer , B. A. Galler, A method for the solution of transportation problems with tall matrices, Communications of the ACM, v.10 n.4, p.231-234, April 1967
	To-Yat Cheung, An interactive graphic display for region partitioning by linear programming, Communications of the ACM, v.17 n.9, p.513-516, Sept. 1974
	G. Terry Ross , D. Klingman , A. Napier, A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems, Journal of the ACM (JACM), v.22 n.3, p.413-424, July 1975
	Fred Glover , David Karney , Darwin Klingman, A note on computational studies for solving transportation problems, Proceedings of the annual conference, p.7-11, August 27-29, 1973, Atlanta, Georgia, United States