A High-Speed Computer Technique for the Transportation Problem
From MaRDI portal
Publication:3272806
DOI10.1145/320924.320927zbMath0095.11802OpenAlexW2126630828MaRDI QIDQ3272806
Publication date: 1958
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/320924.320927
Related Items (8)
Implementation and analysis of alternative algorithms for generalized shortest path problems ⋮ Coding the transportation problem ⋮ Efficient computational devices for the capacitated transportation problem ⋮ An improved version of the out-of-kilter method and a comparative study of computer codes ⋮ Primal transportation and transshipment algorithms ⋮ A streamlined simplex approach to the singly constrained transportation problem ⋮ Use of location-allocation models in health service development planning in developing nations ⋮ Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
This page was built for publication: A High-Speed Computer Technique for the Transportation Problem