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

DOI10.1287/OPRE.18.1.66MaRDI QIDQ5580072zbMATH OpenOpenAlexFDO

Authors Francesco Brioschi, Shimon Even

Publication date 1970

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.18.1.66

zbMATH Keywords

operations research

Cited in

(7)

• Systolic processing for dynamic programming problems
• A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming
• 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
• On the theory of the elimination process
• On non-serial dynamic programming

This page was built for publication: Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems

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