An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem (Q5752282): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038435222 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:39, 20 March 2024
scientific article; zbMATH DE number 4187446
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
