A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems

Full text

Pdf (799 KB)

Source

Journal of the ACM (JACM) archive
Volume 22 , Issue 3 (July 1975) table of contents

Pages: 413 - 424

Year of Publication: 1975

ISSN:0004-5411

Authors

G. Terry Ross	Department of General Business and Finance, University of Massachusetts, Amherst, MA
D. Klingman	Department of General Business, University of Texas at Austin, Austin, TX
A. Napier	Continental Oil Companay, Houston, TX

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 26, Citation Count: 0

Additional Information:

references 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/321892.321903 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	BARn, R. S., CLOVER, l~'., AND KLINGMAN, D. An improved version of the out-of-kilter method and a comparative study of computer codes. Math. Programmil~g (to appear).
	2	BENNINGTON, G.E. An efficient minimal cost flow algorithm. O. R. Rep. 75, North Carolina State U., Raleigh, N. C., June 1972.
	3	CHARNES, A., AND COOPER, W.W. Manageme~t Models a~d Industrial Applications of Linear Programmi~g, 2 vols. Wiley, New York, 1961.
	4	CLASEN, R.J. The numerical solution of network problems using the out-of-kilter algorithm. Memo. RM-5456-PR, RAND Corp., Santa Monica, Calif., March 1968.
	5	DANTZIG, G. Linear Programmil~g a~d Extensio12s. Princeton U. Press, Princeton, N. J., 1963.
	6	Jack B. Dennis, A High-Speed Computer Technique for the Transportation Problem, Journal of the ACM (JACM), v.5 n.2, p.132-153, April 1958 [doi>10.1145/320924.320927]
	7	CLOVER, F., KARNEY, D., AND KLINGMAN, D. Implementation and computational study on start procedures and basis change criteria for a primal network code. Network ~ (1974), 191-212.
	8	CLOVER, F., I{ARNEY, D., AND KLINGMAN, D. The augmented predecessor index method for locating stepping stone paths and assigning dual prices in distribution problems. Transportation Sci. 6, 1 (1972), 171-180.
	9	CLOVER, F., I~ARNEY, D., KLINGMAN, D., AND NAPIER, A. A computational study on start procedures, basis change criteria, and solution algorithms for transportation problems. Manage. Sei. 20, 5 (1974), 793-813.
	10	CLOVER, 1~., I'{ARNEY, D., AND }{LINGMAN, D. Double-pricing dual and feasible start algorithms for the capacitated transportation (distribution) problem. Working paper, Grad. School of Business, U. of Texas at Austin, Austin, Tex., 1970.
	11	CLOVER, F., KLINGMAN, D., AND STI.'TZ, J. Augmented threaded index method for network optimization. INFO (to appear).
	12	HADLEY, G. Li~2ear Programming. Addison-Wesley, Reading, Mass., 1962.
	13	KLINGMAN, D., NAPIER, A., AND STL'TZ, J. NETGEN--A program for generating large scale (un)capacitated assignment, transportation, and minimum cost flow network problems. Manage. Sci. 20, 5 (Jan. 1974), 814-821.
	14	Out-of-kilter network routine. SHARE Distribution 3536, SHARE Distribution Agency, Hawthorne, N.Y., 1967.
	15	REINFELD, N. V., AND VO~EL, W. R. Mathematical Programming. Prentice-Hall, Englewood Cliffs, N. J., 1958.
	16	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 [doi>10.1145/321752.321754]