Extension of dynamic programming to nonseparable dynamic optimization problems
From MaRDI portal
(Redirected from Publication:1179356)
Recommendations
- A class of nonseparable dynamic programming problems
- New approach for nonseparable dynamic programming problems
- Extensions of dynamic programming for multi-stage combinatorial optimization
- Generalizations and applications of a class of dynamic programming problems
- Non-concave dynamic programming
- Dynamic programming for non-additive stochastic objectives
- Experiments with dynamic programming algorithms for nonseparable problems
- Dynamic programming and the Lagrange multipliers
- Efficient application of nonserial dynamic programming in combinatorial optimization
Cites work
- A class of nonseparable dynamic programming problems
- Generalized Dynamic Programming for Stochastic Combinatorial Optimization
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 4095291 (Why is no real title available?)
- Multiple objectives and non-separability in stochastic dynamic programming
- New approach for nonseparable dynamic programming problems
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- The shortest path problem with two objective functions
- Theory and applications of generalized dynamic programming: An overview
Cited in
(14)- A class of nonseparable dynamic programming problems
- New approach for nonseparable dynamic programming problems
- Hierarchical control for large-scale systems with general multiple linear-quadratic structure
- Multilevel dynamic programming for general multiple linear-quadratic control in discrete-time systems
- Experiments with dynamic programming algorithms for nonseparable problems
- A generalization of Bellman's equation with application to path planning, obstacle avoidance and invariant set estimation
- scientific article; zbMATH DE number 4033460 (Why is no real title available?)
- scientific article; zbMATH DE number 721840 (Why is no real title available?)
- Sub- and superoptimality principles of dynamic programming revisited
- scientific article; zbMATH DE number 1406022 (Why is no real title available?)
- scientific article; zbMATH DE number 4195732 (Why is no real title available?)
- Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization
- Multiple objectives and non-separability in stochastic dynamic programming
- A note on the dynamic liquidity trading problem with a mean-variance objective
This page was built for publication: Extension of dynamic programming to nonseparable dynamic optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179356)
