Optimal strategy of route and look for the path constrained search problem with reward criterion
type: Item
instance of: scholarly article
title: Optimal strategy of route and look for the path constrained search problem with reward criterion
zbMATH Open document ID: 0947.90594
DOI: 10.1016/S0377-2217(96)00167-1
author: Ryusuke Hohzaki
author: Koji Iida
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1252708
zbMATH Keywords: military
zbMATH Keywords: search theory
zbMATH Keywords: branch and bound method
zbMATH Keywords: integer programming
zbMATH Keywords: combinatorial analysis
MaRDI profile type: Publication
cites work: Optimal Search for a Moving Target in Discrete Time and Space
cites work: An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
cites work: PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
cites work: THE OPTIMAL SEARCH PLAN FOR A MOVING TARGET MINIMIZING THE EXPECTED RISK
cites work: Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets
cites work: Technical Note—The Complexity of the Optimal Searcher Path Problem
cites work: Search for a Moving Target: The FAB Algorithm
description: scientific article; zbMATH DE number 1252708