This paper presents an algorithm for finding the K loopless paths that have the shortest lengths from one node to another node in a network. The significance of the new algorithm is that its computational upper bound increases only linearly with the value of K. Consequently, in general, the new...

The purpose of this note is to examine the efficiency of Direct Search Method (DSM) in terms of its computational upper bound. Comparisons of the efficiencies of DSM and other efficient algorithms (in terms of their computational upper bounds) are also presented.