Optimal strategy of route and look for the path constrained search problem with reward criterion

DOI10.1016/S0377-2217(96)00167-1zbMath0947.90594MaRDI QIDQ1278090

Koji Iida, Ryusuke Hohzaki

Publication date: 22 February 1999

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

zbMATH Keywords

integer programmingcombinatorial analysismilitarysearch theorybranch and bound method

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Search theory (90B40)

Related Items (4)

Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times ⋮ Moving target search optimization -- a literature review ⋮ A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search ⋮ Optimal search-relocation trade-off in Markovian-target searching

Cites Work

• Search for a Moving Target: The FAB Algorithm
• THE OPTIMAL SEARCH PLAN FOR A MOVING TARGET MINIMIZING THE EXPECTED RISK
• Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets
• Optimal Search for a Moving Target in Discrete Time and Space
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

This page was built for publication: Optimal strategy of route and look for the path constrained search problem with reward criterion