A highly parallel algorithm, for multistage optimization problems and shortest path problems (Q809604): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A highly parallel algorithm, for multistage optimization problems and shortest path problems |
scientific article |
Statements
A highly parallel algorithm, for multistage optimization problems and shortest path problems (English)
0 references
1991
0 references
The authors present a parallel algorithm which solves the multistage optimization problem of n stages. The algorithm based on the recursive application of an aggregation procedure has time complexity O(log n).
0 references
dynamic programming
0 references
divide and conquer
0 references
shortest paths
0 references
