A new dual based procedure for the transportation problem

DOI10.1016/S0377-2217(99)00081-8zbMath0961.90065MaRDI QIDQ1577109

R. R. K. Sharma, K. D. Sharma

Publication date: 30 August 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

transportationdistribution

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (9)

A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies ⋮ An iterative algorithm for two level hierarchical time minimization transportation problem ⋮ Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort ⋮ A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem ⋮ Conic optimization-based algorithms for nonnegative matrix factorization ⋮ EXPERIMENTAL ANALYSIS OF SOME VARIANTS OF VOGEL'S APPROXIMATION METHOD ⋮ Two level hierarchical time minimizing transportation problem ⋮ A heuristic for obtaining better initial feasible solution to the transportation problem ⋮ Obtaining a good primal solution to the uncapacitated transportation problem

Cites Work

• Dual Algorithms for Pure Network Problems
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A new dual based procedure for the transportation problem