Solution of large dense transportation problems using a parallel primal algorithm
- 30 September 1990
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 9 (5), 319-324
- https://doi.org/10.1016/0167-6377(90)90026-2
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problemOperations Research Letters, 1989
- A Parallel Shortest Augmenting Path Algorithm for the Assignment ProblemPublished by Defense Technical Information Center (DTIC) ,1989
- The auction algorithm: A distributed relaxation method for the assignment problemAnnals of Operations Research, 1988
- Contention is no obstacle to shared-memory multiprocessingCommunications of the ACM, 1986
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment AlgorithmsManagement Science, 1977
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation AlgorithmJournal of the ACM, 1973