An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem (Q5752282)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem |
scientific article; zbMATH DE number 4187446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem |
scientific article; zbMATH DE number 4187446 |
Statements
An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem (English)
0 references
1990
0 references
true lower bound
0 references
constrained path, moving target search problem
0 references
discrete time
0 references
0.8945671916007996
0 references
0.886464536190033
0 references
0.8672366738319397
0 references
0.8490211367607117
0 references
