How to find good night train connections (Q3076014): Difference between revisions

@@ Property / cites work @@
+Q2847380
@@ Property / cites work: Q2847380 / rank @@
+Normal rank
@@ Property / cites work @@
+The shortest route through a network with time-dependent internodal transit times
+Normal rank
@@ Property / cites work @@
+Time dependency in multiple objective dynamic programming
+Normal rank
@@ Property / cites work @@
+On the cardinality of the Pareto set in bicriteria shortest path problems
+Normal rank
@@ Property / cites work @@
+Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
+Normal rank
@@ Property / cites work @@
+Minimum weight paths in time-dependent networks
@@ Property / cites work: Minimum weight paths in time-dependent networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4495163
@@ Property / cites work: Q4495163 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2847388
@@ Property / cites work: Q2847388 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient models for timetable information in public transportation systems
+Normal rank
@@ Property / cites work @@
+Dijkstra's algorithm on-line
@@ Property / cites work: Dijkstra's algorithm on-line / rank @@
+Normal rank