An optimal branch-and-bound procedure for the constrained path, moving target search problem

JN Eagle, JR Yee - Operations research, 1990 - pubsonline.informs.org
A searcher and target move among a finite set of cells C= 1, 2,…, N in discrete time. At the
beginning of each time period, one cell is searched. If the target is in the selected cell j, it is …
被引用次数：162 相关文章

An Optimal Branch-And-Bound Procedure For The Constrained P

JN Eagle, JR Yee - Operations Research, 1990 - search.proquest.com
Determining which path to follow when attempting to maximize the probability of detecting a
moving target in a specified time period can be a difficult problem. Approximate procedures …

An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

JN Eagle, JR Yee - Operations Research, 1990 - dl.acm.org
A searcher and target move among a finite set of cells C= 1, 2,', N in discrete time. At the
beginning of each time period, one cell is searched. If the target is in the selected cell j, it is …

An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

JN Eagle, JR Yee - Operations Research, 1990 - cir.nii.ac.jp
抄録< jats: p> A searcher and target move among a finite set of cells C= 1, 2,…, N in discrete
time. At the beginning of each time period, one cell is searched. If the target is in the selected …

An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

JN Eagle, JR Yee - Operations Research, 1990 - econpapers.repec.org
A searcher and target move among a finite set of cells C= 1, 2,…, N in discrete time. At the
beginning of each time period, one cell is searched. If the target is in the selected cell j, it is …

An Optimal Branch-And-Bound Procedure for the Constrained Path, Moving Target Search Problem

JN Eagle, JR Yee - Operations Research, 1990 - JSTOR
A searcher and target move among a finite set of cells C= 1, 2,..., N in discrete time. At the
beginning of each time period, one cell is searched. If the target is in the selected cell j, it is …

An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

JN Eagle, JR Yee - Operations Research, 1990 - ideas.repec.org
A searcher and target move among a finite set of cells C= 1, 2,…, N in discrete time. At the
beginning of each time period, one cell is searched. If the target is in the selected cell j, it is …

AN OPTIMAL BRANCH-AND-BOUND PROCEDURE FOR THE CONSTRAINED PATH, MOVING TARGET SEARCH PROBLEM.

JN Eagle, JR Yee - Operations Research, 1990 - search.ebscohost.com
A searcher and target move among a finite set of cells C= 1, 2...., N in discrete time. At the
beginning of each time period, one cell is searched. If the target is in the selected cell j, it is …

[引用][C] An optimal branch-ann-bound procedure for the constrained path, moving target search problem

JN EAGLE, JR YEE - Operations research, 1990 - pascal-francis.inist.fr
An optimal branch-ann-bound procedure for the constrained path, moving target search
problem CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic Databases …

[引用][C] An Optimal Branch-and-Bound Procedure for the Constrained Path-Moving Target Search Problem

JN EAGLE - Operations Research, 1990 - cir.nii.ac.jp