Solution of large dense transportation problems using a parallel primal algorithm

DOI10.1016/0167-6377(90)90026-2zbMath0711.90054OpenAlexW1967948567MaRDI QIDQ922946

Joseph F. Pekny, Donald L. Miller, Gerald L. Thompson

Publication date: 1990

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(90)90026-2

zbMATH Keywords

assignment problemsprimal transportation algorithm

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)

Related Items

Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations, Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem, Efficient parallel algorithms for the minimum cost flow problem, A survey of dynamic network flows, A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
• The auction algorithm: A distributed relaxation method for the assignment problem
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• A parallel shortest augmenting path algorithm for the assignment problem
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm