The generalized alternating path algorithm for transportation problems
From MaRDI portal
Publication:1245652
DOI10.1016/0377-2217(78)90110-8zbMath0376.90068OpenAlexW2007619363MaRDI QIDQ1245652
Richard S. Barr, Darwin D. Klingman, Fred Glover
Publication date: 1978
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(78)90110-8
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05)
Related Items
An extreme‐point tabu‐search algorithm for fixed‐charge network problems, A survey of dynamic network flows, Primal transportation and transshipment algorithms, An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey
Uses Software
Cites Work
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Technical Note—Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms
- An improved version of the out-of-kilter method and a comparative study of computer codes
- A network simplex method
- The alternating basis algorithm for assignment problems
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Augmented Threaded Index Method For Network Optimization
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- An Efficient Minimal Cost Flow Algorithm
