Augmented Threaded Index Method For Network Optimization

Abstract

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.