A computational improvement for a shortest paths ranking algorithm

DOI10.1016/0377-2217(94)90162-7MaRDI QIDQ1328620zbMATH OpenOpenAlexFDO

Authors José Augusto de Azevedo, Joaquim João E. R. Silvestre Madeira, Ernesto Q. Vieira Martins, Filipe Manuel A. Pires

Publication date 20 February 1995

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(94)90162-7

zbMATH Keywords

labelling algorithmsshortest paths ranking algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• An algorithm for the ranking of shortest paths
• A parallel shortest path algorithm
• An algorithm for ranking quickest simple paths
• scientific article; zbMATH DE number 1003284
• Shortest paths algorithms: Theory and experimental evaluation

Cites work

• An algorithm for the ranking of shortest paths
• An Appraisal of Some Shortest-Path Algorithms

Cited in

(9)

• Improvements for the thresh X2 shortest path algorithm
• Branch-and-price approaches for the network design problem with relays
• Multiobjective routing problems
• A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space
• Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa
• A bicriterion approach for routing problems in multimedia networks
• Regenerator location problem in flexible optical networks
• Improvement and experimental evaluation on classical Bellman-Ford algorithm
• Deviation algorithms for ranking shortest paths

This page was built for publication: A computational improvement for a shortest paths ranking algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328620)