A Shortest Paths Ranking Algorithm

@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}
}
  • A. De, AzevedoJoaquim, +7 authors de Matem
  • Published 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

References

Publications referenced by this paper.
Showing 1-10 of 17 references

An algorithm for ranking paths that may contain cycles

  • E.Q.V. Martins
  • European Journal of Operational Research
  • 1984
Highly Influential
3 Excerpts

A Computational Improvement for a Shortest Paths Ranking Algorithm

  • J. Azevedo, J. Madeira, E. Martins, F. Pires
  • 1989
1 Excerpt

An Algorithm for the Ranking of Shortest Paths, October

  • J. Azevedo, M. Costa, J. Madeira, E. Martins
  • 1989
1 Excerpt

Shortest path methods : a unifying approach

  • G. Gallo, S. Pallotino
  • Mathematical Programming Study
  • 1986

Shortest path methods: a unifying approach, Mathematical Program- ming Study

  • G. Gallo, S. Pallotino
  • 1986
1 Excerpt

A note on the constrained shortest path problem

  • A. K. Pujari, S. Aggarwal, V. P. Gulati
  • Naval Research Logistics Quarterly
  • 1984

E.Q.V., A bicriterion shortest path algorithm

  • Cl maco J.C.N, Martins
  • European Journal of Operational Research
  • 1982
1 Excerpt

J.W.,Network Flow Programming

  • Jensen P.A, Barnes
  • 1980

Similar Papers

Loading similar papers…