Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering (Q2364368)
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 6748538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering |
scientific article; zbMATH DE number 6748538 |
Statements
Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering (English)
0 references
19 July 2017
0 references
dynamic programming
0 references
applied probability
0 references
Markov processes
0 references
transportation
0 references
decision processes
0 references
0 references
0.7241726517677307
0 references
0.7237146496772766
0 references
0.7079089283943176
0 references
0.707575798034668
0 references
0.6993542909622192
0 references
