Dynamic shortest path problems: hybrid routing policies considering network disruptions (Q336651): Difference between revisions

@@ Property / cites work @@
+A new model for path planning with interval data
@@ Property / cites work: A new model for path planning with interval data / rank @@
+Normal rank
@@ Property / cites work @@
+Robust path choice in networks with failures
@@ Property / cites work: Robust path choice in networks with failures / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic shortest path problems with recourse
@@ Property / cites work: Stochastic shortest path problems with recourse / rank @@
+Normal rank
@@ Property / cites work @@
+Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
+Normal rank
@@ Property / cites work @@
+On the online shortest path problem with limited arc cost dependencies
+Normal rank
@@ Property / cites work @@
+The dynamic shortest path problem with anticipation
+Normal rank
@@ Property / cites work @@
+Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming
+Normal rank
@@ Property / cites work @@
+An Analysis of Stochastic Shortest Path Problems
@@ Property / cites work: An Analysis of Stochastic Shortest Path Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Statistical decision functions which minimize the maximum risk
+Normal rank