An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
- 1 February 1990
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 38 (1) , 110-114
- https://doi.org/10.1287/opre.38.1.110
Abstract
No abstract availableKeywords
This publication has 0 references indexed in Scilit: