Implementation and computational comparisons of primal, dual and primal- dual computer codes for minimum cost network flow problem. (English) Zbl 0282.68020

Glover, F.; Karney, D.; Klingman, D.

Networks 4, 191-212 (1974).

MSC:

68W99	Algorithms in computer science
90B10	Deterministic network models in operations research

References:

[1]	Barr, Mathematical Programming
[2]	”An Efficient Minimal Cost Flow Algorithm,” O. R. Report 75, North Carolina State University, Raleigh, North Carolina, June 1972.
[3]	and , Management Models and Industrial Applications of Linear Programming, 2 Vols., John Wiley & Sons, Inc., New York, 1961.
[4]	”The Numerical Solution of Network Problems Using the Out-of-Kilter Algorithm,” RAND Corporation Memoramdum RM-5456-PR, Santa Monica, California, March, 1968.
[5]	Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey, 1963. · Zbl 0108.33103
[6]	Dennis, Journal of Association for Computing Machinery 8 pp 132– (1958) · Zbl 0095.11802
[7]	Flood, Naval Research Logistics Quaterly 8 pp 257– (1971)
[8]	and , Flows in Networks, Princeton University Press, Princeton, New Jersey, 1962.
[9]	and , ”Accelerated Labeling Algorithms for the Maximal Flow Problem with Applications to Transportation and Assignment Problems,” W. P. No. 7222, Graduate School of Management, University of Rochester, December 1972.
[10]	Fulkerson, J. Soc. Indust. Appl. Math. 9 pp 18– (1961)
[11]	Glover, Transprotation Science 6 pp 1– (1972)
[12]	Glover, Management Science 20 pp 5– (1974)
[13]	and , ”Double-Pricing Dual and Feasible Start Algorithms for the Capacitated Transportation (distribution) Problem,” University of Texas at Austin, 1970.
[14]	Glover, OPSEARCH 9 pp 1– (1972)
[15]	Glover, Operations Research 20 pp 1– (1972)
[16]	and , ”The Augmented Threaded Index Method,” Research Report CS 144, Center for Cybernetic Studies, University of Texas, Austin, 1973.
[17]	and , ”A Note on Computational Studies for Solving Transportation Problems,” Proc. of the ACM 1973 Conference, Atlanta.
[18]	Johnson, Operations Research 14 pp 4– (1966)
[19]	and , ”A Computational Study on the Effects of Problem Dimensions on Solution Time for Transportation Problems,” Research Report CS 135, Center for Cybernetic Studies, University of Texas, Austin, 1973.
[20]	Klingman, Management Science 20 pp 5– (1974)
[21]	”Continuous and Integer Generalized Flow Problems,” Ph.D. dissertation, School of Industrial and Systems Engineering, Georgia Institute of Technology, June 1973.
[22]	”An Experimental Study of the Transportation Algorithms,” Master’s Thesis, Graduate School of Business, University of California at Los Angeles, 1968.
[23]	”Network Flow Routine,” YIM/FOCUS Library Number H3 CODA NETFLOW; Control Data Corporation, Software Mfg. and Distribution, 215 Moffett Park Drive, Sunnyvale, California.
[24]	Orden, Management Science 2 pp 3– (1956)
[25]	”Out-of-Kilter Network Routine,” SHARE Distribution 3536, SHARE Distribution Agency, Hawthorne, New York, 1967.
[26]	and , Mathematical Programming, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1958.
[27]	Srinivasan, JACM 20 pp 194– (1973)
[28]	”UKILT-1100 Programmer Reference Manual,” UNIVAC, Data Processing Division, Roseville, Minnesota.
[29]	Principles of Operations Research, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1969.