The K Shortest Loopless Paths Problem

@inproceedings{dos1998TheKS,
  title={The K Shortest Loopless Paths Problem},
  author={Luis Esteves dos and Santosfeqvm},
  year={1998}
}
  • Luis Esteves dos, Santosfeqvm
  • Published 1998
In this note we are concerned with the ranking of shortest loopless paths problem. It is shown that in general this problem does not satisfy the optimality principle and as a consequence only methods based on the computation of a super set of the set of the K shortest loopless paths are valid. It is shown how this methods for the unconstrained problem can be adapted for determining the K shortest loopless paths. 

From This Paper

Topics from this paper.

References

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

A new algorithm for ranking loopless paths

  • E.Q.V. Martins, M.M.B. Pascoal, J.L.E. Santos
  • 1997

Algoritmos para a enumera c~ ao dos k trajectos mais curtos

  • M.M.B. Pascoal
  • (Disserta c~ao de Mestrado; Departamento de…
  • 1997
1 Excerpt

A computational im- provement for a shortest paths ranking algorithm

  • J. A. Azevedo, J.J.E.R.S. Madeira, E.Q.V. Martins, F.M.A. Pires
  • European Journal of Operational Research,
  • 1994
1 Excerpt

An algorithm for the ranking of shortest paths

  • J. A. Azevedo, M.E.O.S. Costa, J.J.E.R.S. Madeira, E.Q.V. Martins
  • European Journal of Operational Research,
  • 1993
1 Excerpt

A shortest paths

  • J. A. Azevedo, J.J.E.R.S. Madeira, E.Q.V. Martins, F.M.A. Pires
  • rank- ing algorithm,
  • 1990
1 Excerpt

An algorithm for ranking paths that may contain cycles

  • E.Q.V. Martins
  • European Journal of Operational Research,
  • 1984
1 Excerpt

Similar Papers

Loading similar papers…