Article ID: | iaor19972145 |
Country: | Netherlands |
Volume: | 73 |
Issue: | 1 |
Start Page Number: | 188 |
End Page Number: | 191 |
Publication Date: | Feb 1994 |
Journal: | European Journal of Operational Research |
Authors: | Silvestre Madeira Joaquim, Vieira Martins Ernesto Q., Azevedo Jos Augusto de, Pires Filipe Manuel A. |
Keywords: | networks: path |
In this short note the authors present a computational improvement for the shortest paths ranking algorithm due to some of the authors. According to its computational complexity, this new version of the algorithm entails a very significant reduction in its execution time and an even larger reduction in the required computer memory space. Computational experiments are reported.