1993European Journal of Operational ResearchRequires access

An algorithm for the ranking of shortest paths

JoséAugusto de Azevedo, Maria Emília O. Santos Costa, Joaquim João E.R. Silvestre Madeira, Ernesto Queirós Vieira Martins

Open publisher page 230 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 230 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: K shortest path routing, Shortest path problem, Yen's algorithm, Shortest Path Faster Algorithm, Constrained Shortest Path First, Algorithm, Floyd–Warshall algorithm, Path (computing)

Related papers

Back to paper searchBrowse research topicsOriginal source
An algorithm for the ranking of shortest paths — Research Paper | ScholarLens