Time depending shortest-path problems with applications to railway networks (Q1388936): Difference between revisions

@@ Property / author @@
-Karl Nachtigall
@@ Property / author: Karl Nachtigall / rank @@
-Normal rank
@@ Property / author @@
+Karl Nachtigall
@@ Property / author: Karl Nachtigall / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3903001
@@ Property / cites work: Q3903001 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimax algebra
@@ Property / cites work: Minimax algebra / rank @@
+Normal rank
@@ Property / cites work @@
+A New Polynomially Bounded Shortest Path Algorithm
+Normal rank
@@ Property / cites work @@
+Shortest path algorithms using dynamic breadth‐first search
+Normal rank
@@ Property / cites work @@
+Dioïds and semirings: Links to fuzzy sets and other applications
+Normal rank
@@ Property / cites work @@
+On a multicriteria shortest path problem
@@ Property / cites work: On a multicriteria shortest path problem / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric connection problems and their solution by bidirectional search
+Normal rank
@@ Property / cites work @@
+Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
+Normal rank
@@ Property / cites work @@
+Properties of Labeling Methods for Determining Shortest Path Trees
+Normal rank
@@ Property / cites work @@
+Linear and combinatorial optimization in ordered algebraic structures
+Normal rank