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

@@ Property / author @@
-Matthias Müller-Hannemann
@@ Property / author: Matthias Müller-Hannemann / rank @@
-Normal rank
@@ Property / author @@
+Matthias Müller-Hannemann
@@ Property / author: Matthias Müller-Hannemann / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20380
@@ Property / full work available at URL: https://doi.org/10.1002/net.20380 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2127124850
@@ Property / OpenAlex ID: W2127124850 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57013180
@@ Property / Wikidata QID: Q57013180 / rank @@
+Normal rank
@@ 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