How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis (Q887851): Difference between revisions

@@ Property / cites work @@
+On finding dissimilar paths
@@ Property / cites work: On finding dissimilar paths / rank @@
+Normal rank
@@ Property / cites work @@
+Reduction approaches for robust shortest path problems
+Normal rank
@@ Property / cites work @@
+On finding dissimilar Pareto-optimal paths
@@ Property / cites work: On finding dissimilar Pareto-optimal paths / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the k Shortest Paths
@@ Property / cites work: Finding the k Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for K shortest simple paths
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the robust shortest path problem with interval data
+Normal rank
@@ Property / cites work @@
+The dynamic shortest path problem with anticipation
+Normal rank
@@ Property / cites work @@
+The Canadian Traveller Problem and its competitive analysis
+Normal rank
@@ Property / cites work @@
+Finding the <i>K</i> Shortest Loopless Paths in a Network
+Normal rank
@@ Property / cites work @@
+The \(k\)-Canadian travelers problem with communication
+Normal rank
@@ Property / cites work @@
+The computational complexity of the relative robust shortest path problem with interval data
+Normal rank