New dual based procedure for the transportation problem

European Journal of Operational Research

Volumn 122, Issue 3, 2000, Pages 611-624

  Sharma, R R K ^a   Sharma, K D ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; PROBLEM SOLVING;

DUAL-BASED METHOD;

OPERATIONS RESEARCH;

EID: 0033888821     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00081-8     Document Type: Article

References (9)

1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows, Prentice Hall, Englewood Cliffs, NJ, 1993.
2. Ali A.I., Padman R., Thiagarajan H. Dual algorithms for pure network problems. Operations Research. 37(1):1989;159-171.
3. Bertsekas D.P., Tseng P. Relaxation methods for minimum cost ordinary and generalised network flow problems. Operations Research. 36:1988;93-114.
4. J.B. Orlin, Genuinely polynomial simplex and non-simplex algorithms for minimum cost problems, Technical Report 1615-84, Sloan School of Management, MIT, Cambridge, MA, 1984.
5. S. Plotkin, E. Tardos, Improved dual network simplex, in: Proceedings of the First ACMN-SIAM Symposium on Discrete Algorithms, 1990, pp. 367-376.
6. K.D. Sharma, A new approach for the simple transportation problem, unpublished M.Tech. dissertation, Department of Industrial and Management Engineering, IIT Kanpur, India, 1998.
7. R.R.K. Sharma, Food grains distribution in the Indian context: An operational study, in O.R. for Development, New Age International, New Delhi, India, 1996, pp. 212-227.
8. R.R.K. Sharma, K.D. Sharma, Computational experience on small sized transportation problems chosen from various textbooks, Technical Report, Industrial and Management Engineering Department, IIT Kanpur, India, 1998.
9. R.R.K. Sharma, K.D. Sharma, Computational experience on large sized ransportation problems generated randomly, Technical Report, Industrial and Management Engineering Department, IIT Kanpur, India, 1998.