Solving the moving target search problem using indistinguishable searchers (Q1711443): Difference between revisions

@@ Property / cites work @@
+Q3649086
@@ Property / cites work: Q3649086 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4225395
@@ Property / cites work: Q4225395 / rank @@
+Normal rank
@@ Property / cites work @@
+Using multiple searchers in constrained-path, moving-target search problems
+Normal rank
@@ Property / cites work @@
+The Optimal Search for a Moving Target When the Search Path Is Constrained
+Normal rank
@@ Property / cites work @@
+An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
+Normal rank
@@ Property / cites work @@
+Q3833854
@@ Property / cites work: Q3833854 / rank @@
+Normal rank
@@ Property / cites work @@
+Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
+Normal rank
@@ Property / cites work @@
+A polynomial time primal network simplex algorithm for minimum cost flows
+Normal rank
@@ Property / cites work @@
+Route optimization for multiple searchers
@@ Property / cites work: Route optimization for multiple searchers / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—The Complexity of the Optimal Searcher Path Problem
+Normal rank
@@ Property / cites work @@
+Branch and bound methods for a search problem
@@ Property / cites work: Branch and bound methods for a search problem / rank @@
+Normal rank