Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times (Q2427183): Difference between revisions

@@ Property / author @@
-H. Y. Lau
@@ Property / author: H. Y. Lau / rank @@
-Normal rank
@@ Property / author @@
+H. Y. Lau
@@ Property / author: H. Y. Lau / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2065549538
@@ Property / OpenAlex ID: W2065549538 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Search for a Moving Target in Discrete Time and Space
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Detection of a Markovian target with optimization of the search efforts under generalized linear constraints
+Normal rank
@@ Property / cites work @@
+Honey-pot constrained searching with local sensory information
+Normal rank
@@ Property / cites work @@
+Using multiple searchers in constrained-path, moving-target search problems
+Normal rank
@@ Property / cites work @@
+An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
+Normal rank
@@ Property / cites work @@
+Optimal strategy of route and look for the path constrained search problem with reward criterion
+Normal rank
@@ Property / cites work @@
+Discrete Sequential Search with Positive Switch Cost
+Normal rank
@@ Property / cites work @@
+Criteria and approximate methods for path-constrained moving-target search problems
+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