Solving the moving target search problem using indistinguishable searchers (Q1711443)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7003092
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the moving target search problem using indistinguishable searchers |
scientific article; zbMATH DE number 7003092 |
Statements
Solving the moving target search problem using indistinguishable searchers (English)
0 references
18 January 2019
0 references
OR in defence
0 references
search theory
0 references
integer programming
0 references
branch and bound
0 references
0 references
0 references
0.8183494210243225
0 references
0.7881730794906616
0 references
0.7875640392303467
0 references
0.7844524383544922
0 references
0.7791013717651367
0 references
