Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming (Q3216467)
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 3882230
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming |
scientific article; zbMATH DE number 3882230 |
Statements
Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming (English)
0 references
1984
0 references
all solutions
0 references
shortest path problems
0 references
depth-first search
0 references
stacking techniques
0 references
near-optimal policies
0 references
0.7577698230743408
0 references
0.7534163594245911
0 references
0.7416971325874329
0 references
0.741187572479248
0 references
0.7328091263771057
0 references
