A polynomial-time algorithm to find shortest paths with recourse (Q4804170)
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 1896661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8727761507034302
0 references
0.8329939842224121
0 references
0.7810694575309753
0 references
0.7795303463935852
0 references
0.7779377102851868
0 references
