A note on detecting unbounded instances of the online shortest path problem (Q4642414)
From MaRDI portal
scientific article; zbMATH DE number 6871411
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on detecting unbounded instances of the online shortest path problem |
scientific article; zbMATH DE number 6871411 |
Statements
A note on detecting unbounded instances of the online shortest path problem (English)
0 references
23 May 2018
0 references
online routing
0 references
recourse
0 references
stochastic shortest paths
0 references
policy iteration
0 references
label correcting
0 references
absorbing Markov chains
0 references
negative arc costs
0 references
