A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming

DOI10.1016/0022-247X(69)90137-1zbMath0181.22904OpenAlexW2072632478MaRDI QIDQ2534842

U. Bertele, Francesco Brioschi

Publication date: 1969

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(69)90137-1

zbMATH Keywords

operations research

Related Items (8)

Systolic processing for dynamic programming problems ⋮ Contribution to nonserial dynamic programming ⋮ A theorem in nonserial dynamic programming ⋮ Nonserial dynamic programming: On the optimal strategy of variable elimination for the rectangular lattice ⋮ Optimal procedures for dynamic programs with complex loop structures ⋮ A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems ⋮ On the theory of the elimination process ⋮ On non-serial dynamic programming

Cites Work

• Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming