Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems

Full text

Pdf (775 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 4 (October 1972) table of contents

Pages: 712 - 726

Year of Publication: 1972

ISSN:0004-5411

Authors

V. Srinivasan	The University of Rochester, Graduate School of Management, Rochester, New York
G. L. Thompson	Carnegie-Mellon University, Graduate School of Industrial Administration, Sehenley Park, Pittsburgh, Pennsylvania

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 20, Citation Count: 5

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/321724.321734 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	BARR, R. S., KLINGMAN, D., AND RAIKE, W.M. Computational simplifications through topological structure in network and distribution models. Series in Appl. Math. for Management, Pub. No. AMM-13, Grad. School of Business, U. of Texas, Austin, Texas, 1968.
	2	BERGE, C. The Theory of Graphs and Its Applications. Wiley, New York, 1962.
	3	CHARNES, A., AND COOPER, W.W. Management Models and Industrial Applications of Linear Programming, Vols. I and II. Wiley, New York, 1961.
	4	DANTZlG, G. B. Linear Programming and Extensions. Princeton U. Press, Princeton, N. J., 1963.
	5	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]
	6	DIJKSTRA, E.W. A note on two problems in connection with graphs. Numer. Math. i (1959), 269-271.
	7	EASTMAN, W. L . Linear programming with pattern constraints. Ph.D. DiNs., Harvard U., Cambridge, Mass. 1958.
	8	FORD, L. R., AND FULKERSON, D.R. Flows in Networks. Princeton U. Press, Princeton, N. J., 1962.
	9	FORTRAN Transportation Code, Contributed Program Library, 360D-15.2.010. IBM, New York, 1968.
	10	GAVER, D. P., AND THOMPSON, G. L. Mathematical Models--Programming and Probability. Brooks/Cole Pub. Co., Belmont, Calif. (to be published, 1973).
	11	GLICKSMAN, S., JOHNSON, L., AND ESELSON, L. Coding the transportation problem. Naval Res. Logist. Quart. 7 (1960), 169-183.
	12	GLOVER, F., AND KLINGMAN, D. Locating stepping-stone paths in distribution problems via the predecessor index method. Transportation Sci. 4 (1970), 220-225.
	13	HAMMER, P.L. Time-minimizing transportation problems. Naval Res. Logist Quart. 16 (1969), 345-357.
	14	KRUSKAL, J. On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Amer. Math. Soc. 7 (1956), 48-50.
	15	LOURiE, J. R. Topology and computation of the generalized transportation problem. Management Sci. 11 (1964), 177-187.
	16	MURTY, K.G. Solving the fixed charge problem by ranking the extremepoints. Operations Res. 16 (1968), 268-279.
	17	SBINIVASAN V., AND THOMPSON, G.L. An operator theory of parametric programming for the transportation problem, I. Naval Res. Logist. Quart. 19 (to appear).
	18	SRINIVASAN, V., AND THOMPSON, G.L. An operator theory of parametric programming for the transportation problem, II. Naval Res. Logist. Quart. 19 (to appear).
	19	SRINIVASAN, V., AND THOMPSON, G.L. Benefit-cost analysis of coding techniques for the primal transportation algorithm. Management Sci. Res. Rep. No. 229, Grad. School of Ind. Admin., Carnegie-Mellon U., Pittsburgh, Pa.; to appear in J. ACM.

CITED BY 5

	To-Yat Cheung, Computational Comparison of Eight Methods for the Maximum Network Flow Problem, ACM Transactions on Mathematical Software (TOMS), v.6 n.1, p.1-16, March 1980
	John M. Mulvey, Pivot Strategies for Primal-Simplex Network Codes, Journal of the ACM (JACM), v.25 n.2, p.266-270, April 1978
	Britton Harris, A Code for the Transportation Problem of Linear Programming, Journal of the ACM (JACM), v.23 n.1, p.155-157, Jan. 1976
	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
	Fred Glover , Darwin Klingman, A practitioner's guide to the state of large scale network and network-related problems, Proceedings of the June 7-10, 1976, national computer conference and exposition, June 07-10, 1976, New York, New York