A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem (Q5931724): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003376
@@ Property / cites work: Q4003376 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-path algorithms: Taxonomy and annotation
@@ Property / cites work: Shortest-path algorithms: Taxonomy and annotation / 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 New Polynomially Bounded Shortest Path Algorithm
+Normal rank
@@ Property / cites work @@
+Deterministic network optimization: A bibliography
+Normal rank
@@ Property / cites work @@
+Shortest‐path methods: Complexity, interrelations and new propositions
+Normal rank
@@ Property / cites work @@
+Shortest Path Algorithms: An Evaluation Using Real Road Networks
+Normal rank
@@ Property / cites work @@
+Computational experience with an algorithm for finding the k shortest paths in a network
+Normal rank
@@ Property / cites work @@
+Iterative methods for determining the k shortest paths in a network
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5931724