Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently

Full text

Pdf (663 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 1 , Issue 1 (March 1975) table of contents

Pages: 47 - 55

Year of Publication: 1975

ISSN:0098-3500

Authors

Fred Glover	Department of Management Science, University of Colorado, Boulder, CO
Darwin Klingman	Center for Cybernetic Studies, University of Texas at Austin, Austin, TX

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 40, Citation Count: 1

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/355626.355634 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	APPA, G.M. The transportation problem and its variants. Oper. Res. Quart. 23 (1973), 79-97.
	2	BABAYEV, D. Mathematical model for optimal location of oil platforms and assignment of directed wells. Inst. of Cybernetics, Acad. of Sci. SSR, Baku.
	3	BALAS, E., AND IVANESCU (HAMMER), P. L. On the generalized transportation problem. Manage. Sci. 11 (1964), 188-202.
	4	BARR, R. S., GLOVER, F., AND KLINGMAN, D. An improved version of the out-of-kilter method and a comparative study of computer codes. To appear in Math. Programming.
	5	BENNINGTON, G.E. An efficient minimal cost flow algorithm. Oper. l~es. Rep. 75, North Carolina State U., Raleigh, N. C. June 1972.
	6	CHARNES, A., AND COOPEa, W.W. Management Models and Industrial A pplicatwns of Linear Programming, Vols. I and II. Wiley, New York, 1961.
	7	CHARNES, A., COOPER, W. W., KLINGMAN, D., AND NIEHAUS, A. Static and dynamic biased quadratic multi-attribute assignment models: solutions and equivalents. Rep. CSl15, Cent. for Cybernetic Studies, U. of Texas at Austin, Tex.
	8	CHARNES, A., GLOVER, F., AND KLINGMAN, D. A note on a distribution problem. Oper. Res. 18, 6(1970), 1213-1216.
	9	CHARNES, A., GLOVER, F., AND KLINGMAN, D. The lower bounded and partial upper bounded distribution model. Naval Res. Logist. Quart. 18 (1971), 277-278.
	10	CHARNES, A., AND KmNGMAN, D. The distribution problem with upper and lower bounds on the node requirements. Manage. Scz. 16, 9 (1970), 638-642.
	11	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.
	12	Dx~TZm, G. Actwity Analyszs of Productwn and Allocatwn, T. C. Koopmans, Ed., Wiley, New York, 1951, Ch. 23.
	13	GLOVER, F., KARNEY, D., AND KLINGMAN, D. Implementation and computational study on start procedures and basis change criteria for a primal network code. To appear in Networks.
	14	GLOVER, F., K~RNEr, D., AND KLI~rGMAN, D. The augmented predecessor index method for locating stepping stone paths and assigning dual prices in distribution problems. Transport. Sci. 6 (1972), 171-180.
	15	GLOVER, F., KARNEY, D., KLINOMAN, D., AND NAPmR, A. A computational study on start procedures, basis change criteria, and solution algorithms for transportation problems. Manage. Sc~. 20, 5 (1974), 793-814.
	16	GLOVER, F., KARN~Y, D., AriD KLINGMAN, D. Double-pricing dual and feasible start algorithms for the capacitated transportation (distribution) problem. U. of Texas at Austin, Tex., 1970.
	17	GLOVER, F., KLINGMAN, D., AND STUTZ, J. Extensions of the augmented predecessor index method to generalized network problems. Transport. Sci. 7, 4 (1973), 377-384.
	18	GLOVER, F., AND KLINGMAN, D. Finding minimum spanning trees with a fixed number of links on a node. Presented at the 45th Nat. ORSA/TIMS Meeting, Boston, Mass., April 22-24, 1974.
	19	GLOVER, F., AND KLINGMAN, D. A note on computational simplification in solving generalized transportation problems. Transport. Sci. 7 (1973), 351-361.
	20	GLOVER, F., AND KLINGMAN, D. On the equivalence of some generalized network problems to pure network problems. Math. Programming 4,, 3 (1973), 369-378.
	21	GLOVER, F., KLINGMAN, D., AND NAPIER, A. Basic dual feasible solutions for a class of generalized networks. Oper. Res. 20, 1 (1972), 126-137.
	22	GLOVER, F., KLINGMAN, D., AND ROSS, G.W. Finding equivalent transportation formulation for constrained transportation problems. Naval Res. Logist. Quart. 21, 2 (1974).
	23	GLOVER, F., KLINGMAN, D., AND STUTZ, J. implementation and computational study of a generalized network code. Presented at the 44th Nat. Meeting of ORSA, San Diego, Calif., Nov. 12-14, 1973.
	24	JEWELL, W.S. Optimal flow through network with gains. Oper. Res. 10 (1962), 476-499.
	25	JOHNSON, E. Networks and basic solutions. Oper. Res. 1~, 4 (1966), 619-623.
	26	KARNEV, D., AND KHNOMAN, D. Implementation and computational study on an in-core out-of-core primal network code. Res. Rep. CS 158, Cent. for Cybernetic Studies, U. of Texas at Austin, Tex.
	27	KLINGMAN, D., NAPIER, A., AND ROSS, G. A computational study on the effects of problem dimensions on solution time for transportation problems. Res. Rep. CS 135, Cent. for Cybernetic Studies, U. of Texas at Austin, Tex., 1973.
	28	KLINaMA~, D., NAPIv.~~, A., AND STuTz, J. NETGEN--a program for generating large scale (un)capacitated assignment, transportation, and minimum cost flow network problems. Manage. Sci. P0, 5 (1974), 814-822.
	29	KmNOMAN, D., RANDOLPH, P., AND FULLER, S. ~k cottonpickin' cotton ginning problem. Presented at the 44th Nat. Meeting of the Operations Research Society of America, San Diego, Calif., Nov. 10-12, 1973.
	30	KLINGMAN, D., AND ROSS, T. Finding equivalent network formulations for constrained network problems. Res. Rep. C.S. 108, Cent. for Cybernetic Studies, U. of Texas at Austin, Tex.
	31	KUNG~AN, D., AND Russ~.LL, R. On solving constrained transportation problems. To appear in Oper. Res. Quart..
	32	KLINGMAN, D., AND RUSSELL, R. The transportation problem with mixed constraints. To appear in Oper. Res. Quart.
	33	KL~NG~AN, D., AnD STUTZ, J. Computational testing on an integer generalized network code. Presented at the 45th Nat. ORSA/TIMS Meeting, Boston, Mass., April 22-24, 1974.
	34	Loving, J. Topology and computation of the generalized transportation problem. Manage. Sci. 11 (1964), 177-187.
	35	Out-of-kilter network routine. SHARE Distribution 3536, Share Distr. Agency, Hawthorne, N. Y., 1967.
	36	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]
	37	WAON~a, H. The lower bounded and partial upper bounded distribution model. To appear in Naval I~es. Logist. Quart.
	38	WAGNER, H. Principles of Operations Research w~th Application to Managerial Decisions. Prentice-Hall, Englewood Cliffs, N.J., 1969.