References
- A. Charnes and W.W. Cooper, The stepping stone method of explaining linear programming calculations in transportation problems. Management Science 1954; 1, 49–69. doi: 10.1287/mnsc.1.1.49
- A. Charnes, W.W. Cooper and A. Henderson, An Introduction to Linear Programming. New York: Wiley, 1953.
- E. J. Russell, Extension of Dantzig’s algorithm to finding an initial near-optimal basis for the transportation problem. Operations Research 1969; 17, 187–191. doi: 10.1287/opre.17.1.187
- F.L. Hitchcock, The distribution of a product from several sources to numerous locations. Journal of Mathematics and Physics 1941; 20, 224–230. doi: 10.1002/sapm1941201224
- G.B. Dantzig, Application of the simplex method to a transportation problem, In Activity Analysis of Production and Allocation. (Edited by T.C. Koopmans), New York: John Wiley & Sons, 1951.
- H.S. Houthakker, On the numerical solution of the transportation problem. Operations Research 1955; 3, 210–214.
- Kala S, Das B. A transportation problem with queuing contract. Journal of Information and Optimization Sciences. 2016 Jul 3;37(4):535–48. doi: 10.1080/02522667.2015.1103051
- N.V. Reinfeld and W.R. Vogel, Mathematical Programming. New Jersey: Prentice-Hall, 1958.
- Taha, H.A., Operations research: an introduction.7th Edition. New Jersey: Prentice-Hall, 2003.
- T.C. Koopmans, Optimum utilization of the transportation system. In Proceedings of the International Statistical Conference, Washington: DC, 1947.
- Wu SY. Extremal points and an algorithm for a class of continuous transportation problems. Journal of Information and Optimization Sciences. 1992 Jan 1;13(1):97–106. doi: 10.1080/02522667.1992.10699095