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

DOI10.1016/j.ejor.2007.06.043zbMath1146.90368OpenAlexW2065549538MaRDI QIDQ2427183

Gamini Dissanayake, Shoudong Huang, H. Y. Lau

Publication date: 8 May 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10453/9249

zbMATH Keywords

Markov processesbranch and boundglobal optimisationsearch theory

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (10)

Trajectory optimization under kinematical constraints for moving target search ⋮ Aerial vehicle search-path optimization: a novel method for emergency operations ⋮ Cops and invisible robbers: the cost of drunkenness ⋮ The eye and the fist: optimizing search and interdiction ⋮ Solving the moving target search problem using indistinguishable searchers ⋮ Moving target search optimization -- a literature review ⋮ Path optimization for the resource-constrained searcher ⋮ Minimizing the average searching time for an object within a graph ⋮ Route optimization for multiple searchers ⋮ Ant colony optimization for path planning in search and rescue operations

Cites Work

• Unnamed Item
• Optimal strategy of route and look for the path constrained search problem with reward criterion
• Honey-pot constrained searching with local sensory information
• Optimal Search for a Moving Target in Discrete Time and Space
• Discrete Sequential Search with Positive Switch Cost
• Branch and bound methods for a search problem
• Detection of a Markovian target with optimization of the search efforts under generalized linear constraints
• Criteria and approximate methods for path-constrained moving-target search problems
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Using multiple searchers in constrained-path, moving-target search problems
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

This page was built for publication: Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times