Augmented Threaded Index Method For Network Optimization
Fred Glover, Darwin D. Klingman, Joel Stutz · INFOR Information Systems and Operational Research · 1974
Easily manipulated list structures for recording the basis tree for adjacent extreme point (“simplex type”) network algorithms are paramount to the development of computationally efficient network algorithms. This paper presents a new list structure which is shown to be computationally more efficient and to require one-third less computer memory to implement than all alternate list structures.
Cited by 91 works. doi:10.1080/03155986.1974.11731583
Authors
References
- The Art of Computer Programming. Volume 1: Fundamental Algorithms.
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- Networks and Basic Solutions
- The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution Problems
- THE NUMERICAL SOLUTION OF NETWORK PROBLEMS USING THE OUT-OF-KILTER ALGORITHM
- An Efficient Minimal Cost Flow Algorithm
- Double-Pricing Dual and Feasible Start Algorithms for the Capacitated Transportation (Distribution) Problem
- Extensions of the Augmented Predecessor Index Method to Generalized Network Problems
- A note on computational studies for solving transportation problems
- Past, Present and Future of Development, Computational Efficiency, and Practical Use of Large Scale Transportation and Transhipment Computer Codes