DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS (Q5249002): Difference between revisions

@@ Property / cites work @@
+An algorithm for the ranking of shortest paths
@@ Property / cites work: An algorithm for the ranking of shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+A computational improvement for a shortest paths ranking algorithm
+Normal rank
@@ Property / cites work @@
+A bicriterion shortest path algorithm
@@ Property / cites work: A bicriterion shortest path algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
+Normal rank
@@ Property / cites work @@
+A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Appraisal of Some Shortest-Path Algorithms
@@ Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest path methods: A unifying approach
@@ Property / cites work: Shortest path methods: A unifying approach / rank @@
+Normal rank
@@ Property / cites work @@
+A Method for the Solution of the             <i>N</i>             th Best Path Problem
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for K shortest simple paths
+Normal rank
@@ Property / cites work @@
+An algorithm for ranking paths that may contain cycles
+Normal rank
@@ Property / cites work @@
+Iterative methods for determining the k shortest paths in a network
+Normal rank
@@ Property / cites work @@
+On algorithms for finding the k shortest paths in a network
+Normal rank
@@ Property / cites work @@
+Disjoint paths in a network
@@ Property / cites work: Disjoint paths in a network / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the <i>K</i> Shortest Loopless Paths in a Network
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0129054199000186
+Normal rank
@@ Property / OpenAlex ID @@
+W2112643276
@@ Property / OpenAlex ID: W2112643276 / rank @@
+Normal rank