Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times (Q2427183)
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: Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times |
scientific article |
Statements
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times (English)
0 references
8 May 2008
0 references
search theory
0 references
branch and bound
0 references
global optimisation
0 references
Markov processes
0 references
0 references
0 references
0 references
