G. Terry Ross
- 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).Google Scholar
- 2 BENNINGTON, G.E. An efficient minimal cost flow algorithm. O. R. Rep. 75, North Carolina State U., Raleigh, N. C., June 1972.Google Scholar
- 3 CHARNES, A., AND COOPER, W.W. Manageme~t Models a~d Industrial Applications of Linear Programmi~g, 2 vols. Wiley, New York, 1961.Google Scholar
- 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.Google Scholar
- 5 DANTZIG, G. Linear Programmil~g a~d Extensio12s. Princeton U. Press, Princeton, N. J., 1963.Google Scholar
- 6 DENNIS, J. B. A high-speed computer technique for the transportation problem. J. ACM 8 (1958), 132-153. Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 11 CLOVER, F., KLINGMAN, D., AND STI.'TZ, J. Augmented threaded index method for network optimization. INFO (to appear).Google Scholar
- 12 HADLEY, G. Li~2ear Programming. Addison-Wesley, Reading, Mass., 1962.Google Scholar
- 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.Google Scholar
- 14 Out-of-kilter network routine. SHARE Distribution 3536, SHARE Distribution Agency, Hawthorne, N.Y., 1967.Google Scholar
- 15 REINFELD, N. V., AND VO~EL, W. R. Mathematical Programming. Prentice-Hall, Englewood Cliffs, N. J., 1958.Google Scholar
- 16 SRINIVAS^N, V., AND THOMPSOS, G. L. Benefit-cost analysis of coding techniques for the primal transportation algorithm. J. ACM 20, 2 (April 1973), 194-213. Google Scholar
Index Terms
- A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems
Recommendations
Effects of Left Inferior Prefrontal Stimulation on Episodic Memory Formation: A Two-Stage fMRI–rTMS Study
Successful recovery of words from episodic memory relies strongly on semantic processes at the time of encoding. Evidence from several functional magnetic resonance imaging (fMRI) studies has shown that changes in neural activity in the left inferior ...
A Dynamic Causal Modeling Study on Category Effects: Bottom–Up or Top–Down Mediation?
In this study, we combined functional magnetic resonance imaging (fMRI) and dynamic causal modeling (DCM) to investigate whether object category effects in the occipital and temporal cortex are mediated by inputs from early visual cortex or parietal ...
Disentangling neural sources of problem size and interference effects in multiplication
Multiplication is thought to be primarily solved via direct retrieval from memory. Two of the main factors known to influence the retrieval of multiplication facts are problem size and interference. Because these factors are often intertwined, we sought ...
Comments