A polynomial-time algorithm to find shortest paths with recourse (Q4804170)
From MaRDI portal
scientific article; zbMATH DE number 1896661
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm to find shortest paths with recourse |
scientific article; zbMATH DE number 1896661 |
Statements
A polynomial-time algorithm to find shortest paths with recourse (English)
0 references
10 April 2003
0 references
stochastic network
0 references
shortest path
0 references
recourse
0 references
dynamic shortest path
0 references
Dijkstra
0 references
