Using multiple searchers in constrained-path, moving-target search problems (Q4883164)
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: Using multiple searchers in constrained-path, moving-target search problems |
scientific article; zbMATH DE number 895006
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using multiple searchers in constrained-path, moving-target search problems |
scientific article; zbMATH DE number 895006 |
Statements
1 July 1996
0 references
multiple-searcher, moving-target search problem
0 references
branch-and-bound
0 references
heuristics
0 references
constrained-path problems
0 references
Using multiple searchers in constrained-path, moving-target search problems (English)
0 references
