A highly parallel algorithm, for multistage optimization problems and shortest path problems

DOI10.1016/0743-7315(91)90126-TzbMath0733.68036MaRDI QIDQ809604

Wei K. Tsai, John K. Antonio, Garng M. Huang

Publication date: 1991

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingshortest pathsdivide and conquer

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

Invariant imbedding and parallelism in dynamic programming for feedback control ⋮ Identification and robustness analysis of nonlinear multi-stage enzyme-catalytic dynamical system in batch culture

This page was built for publication: A highly parallel algorithm, for multistage optimization problems and shortest path problems