Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem (Q1617289): Difference between revisions

@@ Property / author @@
+Maged M. Dessouky
@@ Property / author: Maged M. Dessouky / 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.1007/s10951-017-0535-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2736751709
@@ Property / OpenAlex ID: W2736751709 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic shortest paths minimizing travel times and costs
+Normal rank
@@ Property / cites work @@
+Time-varying shortest path problems with constraints
+Normal rank
@@ Property / cites work @@
+The shortest route through a network with time-dependent internodal transit times
+Normal rank
@@ Property / cites work @@
+Dynamic graph generation for the shortest path problem in time expanded networks
+Normal rank
@@ Property / cites work @@
+Continuous-Time Dynamic Shortest Path Problems with Negative Transit Times
+Normal rank
@@ Property / cites work @@
+Exact train pathing
@@ Property / cites work: Exact train pathing / rank @@
+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 @@
+Continuous-Time Shortest Path Problems and Linear Programming
+Normal rank