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

DOI10.1016/0898-1221(90)90144-9MaRDI QIDQ2277161zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Computational aspects of dynamic programming
• scientific article; zbMATH DE number 626189
• Solving a class of two-dimensional uncapacitated location-allocation problems by dynamic programming
• Generalized dynamic programming and its applications
• Generalized dynamic programming. General points

Cites work

• scientific article; zbMATH DE number 3650295 (Why is no real title available?)
• scientific article; zbMATH DE number 3174053 (Why is no real title available?)
• scientific article; zbMATH DE number 3718880 (Why is no real title available?)
• scientific article; zbMATH DE number 3532701 (Why is no real title available?)
• scientific article; zbMATH DE number 3325181 (Why is no real title available?)
• A New Decomposition Procedure for Dynamic Programming
• A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• An Algorithm for Nonlinear Knapsack Problems
• Branch-and-Bound Strategies for Dynamic Programming
• Letter to the Editor—An Approach to Reducing the Computing Time for Dynamic Programming
• Mathematical Programming and the Maximum Transform
• Reducing the Memory Requirements of Dynamic Programming
• Terminal state dynamic programming for differential-difference equations
• Terminal state dynamic programming: Quadratic costs, linear differential equations
• The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions

Cited in

(2)

• Fast value iteration: an application of Legendre-Fenchel duality to a class of deterministic dynamic programming problems in discrete time
• Beating a Benchmark: Dynamic Programming May Not Be the Right Numerical Approach

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

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