The generalized alternating path algorithm for transportation problems
From MaRDI portal
Publication:1245652
Cites work
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- A network simplex method
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- An Efficient Minimal Cost Flow Algorithm
- An improved version of the out-of-kilter method and a comparative study of computer codes
- Augmented Threaded Index Method For Network Optimization
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow 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
- The alternating basis algorithm for assignment problems
Cited in
(6)- 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
- An extreme‐point tabu‐search algorithm for fixed‐charge network problems
This page was built for publication: The generalized alternating path algorithm for transportation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245652)
