A computational improvement for a shortest paths ranking algorithm

In this short note we 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 r...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research 1994-02, Vol.73 (1), p.188-191
Hauptverfasser:	de Azevedo, JoséAugusto, Silvestre Madeira, Joaquim João E.R., Vieira Martins, Ernesto Q., Pires, Filipe Manuel A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Exact sciences and technology Flows in networks. Combinatorial problems Labelling algorithms Mathematical models Network Operational research and scientific management Operational research. Management science Operations research Optimization Shortest path Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this short note we 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.
ISSN:	0377-2217 1872-6860
DOI:	10.1016/0377-2217(94)90162-7