A highly parallel algorithm, for multistage optimization problems and shortest path problems (Q809604)
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: A highly parallel algorithm, for multistage optimization problems and shortest path problems |
scientific article; zbMATH DE number 4213447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A highly parallel algorithm, for multistage optimization problems and shortest path problems |
scientific article; zbMATH DE number 4213447 |
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
0.8020015954971313
0 references
0.791526734828949
0 references
