Computational experiments with a class of dynamic programming algorithms of higher dimensions

DOI10.1016/0898-1221(90)90144-9zbMath0724.90078OpenAlexW2087529608MaRDI QIDQ2277161

Yanyan Li

Publication date: 1990

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(90)90144-9

zbMATH Keywords

course of dimensionality

Mathematics Subject Classification ID

Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Fast value iteration: an application of Legendre-Fenchel duality to a class of deterministic dynamic programming problems in discrete time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
• Terminal state dynamic programming: Quadratic costs, linear differential equations
• Terminal state dynamic programming for differential-difference equations
• Mathematical Programming and the Maximum Transform
• Branch-and-Bound Strategies for Dynamic Programming
• An Algorithm for Nonlinear Knapsack Problems
• A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
• Reducing the Memory Requirements of Dynamic Programming
• Letter to the Editor—An Approach to Reducing the Computing Time for Dynamic Programming
• A New Decomposition Procedure for Dynamic Programming
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables

This page was built for publication: Computational experiments with a class of dynamic programming algorithms of higher dimensions