@inproceedings{De1990ASP,
title={A Shortest Paths Ranking Algorithm},
author={A. De and AzevedoJoaquim and Jo and Enrique Silvestre and MadeiraErnesto and Q. Vieira and MartinsFilipe and A. Manuel and PiresDepartamento and de Matem},
year={1990}
}

The ranking of K shortest paths is a classical network optimization problem with a large range of real world applications. Take as an example the constrained shortest path problem, where some complex set of constraints is associated with each path. If these constraints are ignored and paths are listed by increasing order of objective values, the shortest path verifying the given set of constraints is thus determined. The shortest path ranking problem may also occur in the multiobjective… CONTINUE READING