References
- Altman , M. 1965 . Two gradient method algorithms for linear programming with application to the decomposition problem . Bulletin de l'Académie Polonaise des sciences Série des sciences math., astr. et phys. , 13 : 465 – 472 .
- Altman , M. 1965 . The sign-gradient method algorithms in linear programming . Analele Stiintifice , II : 323 – 330 . Universit.Al.l. Cusa (Jasi)
- Altman , M. 1967 . A method of solving the transportation problem . Bulletin de l'Académie Polonaise des sciences Série des sciences math. , 15 : 801 – 811 . astr. et phys.
- Altman , T. 1982 . XI International Symposium on Mathematical Programming . A gradient directed primal-dual algorithm for the transportation problem . 1982 , Bonn, W. Germany.
- Armstrong , R. D. , Klingman , D. and Whitman , D. 1980 . Implementation and analysis of a variant of the dual method for the capacitated transshipment problem . European Journal of Operational Research , 4 : 403 – 420 .
- Glover F. Klingman D. Recent developments in computer implementation technology for network flow algorithms University of Texas Austin 1980 Research Report CCS 377
- Ikura Y. Nemhauser G. L. A polynomial-time dual simplex algorithm for the transportation problem Cornell University Ithaca, N.Y. 1983 Tech. Report 602, School of Operations Research and Industrial Engineering
- Orlin J. B. On the simplex method for networks and generalized networks Mathematical Programming to appear
- Srinivasan , V. and Thompson , G. L. 1977 . Cost operator algorithms for the transportation problem . Mathematical Programming , 12 : 372 – 391 .
- Tardos , E. 1985 . A strongly polynomial minimum cost circulation algorithm . Combinatorica , 5 : 247 – 255 .
- Yudin , D. B. and Gol'stein , E. G. 1963 . Linear Programming , : 507 – 531 . (in Russian)