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 this page instead for the normal view: Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming |
scientific article |
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
