Technical Note—Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms
From MaRDI portal
Publication:4073123
DOI10.1287/opre.23.6.1167zbMath0313.90041OpenAlexW1986979770MaRDI QIDQ4073123
Publication date: 1975
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.23.6.1167
Related Items (4)
The generalized alternating path algorithm for transportation problems ⋮ On the use of tree indexing methods in transportation algorithms ⋮ A new algorithm for the assignment problem ⋮ A variant of time minimizing assignment problem
This page was built for publication: Technical Note—Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms
