Deviation Algorithms for Ranking Shortest Paths
暂无分享,去创建一个
Marta M. B. Pascoal | Ernesto de Queirós Vieira Martins | José Luis E. Dos Santos | E. Martins | J. L. Santos | M. Pascoal
[1] Santosfeqvm,et al. A NEW ALGORITHM FOR RANKING LOOPLESS PATHS , 1997 .
[2] E. Denardo,et al. Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..
[3] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[4] Douglas R. Shier,et al. Iterative methods for determining the k shortest paths in a network , 1976, Networks.
[5] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[6] E. Martins,et al. A bicriterion shortest path algorithm , 1982 .
[7] Douglas R. Shier,et al. Computational experience with an algorithm for finding the k shortest paths in a network , 1974 .
[8] Richard Pavley,et al. A Method for the Solution of the Nth Best Path Problem , 1959, JACM.
[9] Ernesto de Queirós Vieira Martins,et al. A Shortest Paths Ranking Algorithm , 1990 .
[10] Marta M. B. Pascoal. Algoritmos para a enumeração dos K trajectos mais curtos , 1997 .
[11] G. Gallo,et al. SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .
[12] E. Martins,et al. An algorithm for the ranking of shortest paths , 1993 .
[13] J. W. Suuballe,et al. Disjoint Paths in a Network , 2022 .
[14] E. Martins,et al. A computational improvement for a shortest paths ranking algorithm , 1994 .
[15] Douglas R. Shier,et al. On algorithms for finding the k shortest paths in a network , 1979, Networks.
[16] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.
[17] Pierre Hansen,et al. Bicriterion Path Problems , 1980 .
[18] Toshihide Ibaraki,et al. An efficient algorithm for K shortest simple paths , 1982, Networks.
[19] David Eppstein,et al. Finding the k Shortest Paths , 1999, SIAM J. Comput..
[20] E. Martins. An algorithm for ranking paths that may contain cycles , 1984 .
[21] L FredmanMichael,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987 .
[22] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.
[23] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[24] Narsingh Deo,et al. Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.
[25] Jose Luis Esteves dos Santos,et al. A New Shortest Paths Ranking Algorithm , 1999 .