Solving the moving target search problem using indistinguishable searchers (Q1711443): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q128913978, #quickstatements; #temporary_batch_1723507444692 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2018.11.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2018.11.006 / rank | |||
Normal rank | |||
Latest revision as of 05:23, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the moving target search problem using indistinguishable searchers |
scientific article |
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
