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

DOI10.1016/0743-7315(91)90126-TzbMATH Open0733.68036MaRDI QIDQ809604FDOQ809604

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

Publication date: 1991

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

Recommendations

• scientific article; zbMATH DE number 56471
• scientific article; zbMATH DE number 3850854
• Parallel algorithms for solving aggregated shortest-path problems
• scientific article; zbMATH DE number 822184
• Optimal parallel algorithm for shortest-paths problem on interval graphs

zbMATH Keywords

dynamic programmingshortest pathsdivide and conquer

Mathematics Subject Classification ID

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

Cited In (5)

• Invariant imbedding and parallelism in dynamic programming for feedback control
• Title not available (Why is that?)
• A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM
• A parallel shortest augmenting path algorithm for the assignment problem
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809604)