Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming (Q3216467): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.32.6.1381 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.32.6.1381 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015035116 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.32.6.1381 / rank | |||
Normal rank | |||
Latest revision as of 22:14, 20 December 2024
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
