Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times-Reference-Cited by-同舟云学术

Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times

Published:2008-10 Issue:2 Volume:190 Page:383-397
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Lau Haye,Huang Shoudong,Dissanayake Gamini

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference19 articles.

1. Optimal search for a moving target in discrete time and space;Brown;Operations Research,1980

2. Introduction to Algorithms;Cormen,1990

3. Detection of a Markovian target with optimization of the search efforts under generalized linear constraints;Dambreville;Naval Research Logistics,2002

4. Honey-pot constrained searching with local sensory information;DasGupta;Journal of Nonlinear Analysis: Hybrid Systems and Applications,2006

5. Using multiple searchers in constrained-path, moving-target search problems;Dell;Naval Research Logistics,1996

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Effective anti-submarine decision support system based on heuristic rank-based Dijkstra and adaptive threshold partitioning mechanism;Applied Soft Computing;2024-08

2. Optimizing Surveillance Satellites for the Synthetic Theater Operations Research Model;MIL OPER RES;2024

3. Multi‐agent search for a moving and camouflaging target;Naval Research Logistics (NRL);2023-11-21

4. Ant colony optimization for path planning in search and rescue operations;European Journal of Operational Research;2023-02

5. Supervised learning for maritime search operations: An artificial intelligence approach to search efficiency evaluation;Expert Systems with Applications;2022-11