Create divide and conquer, dynamic programming, and greedy algorithms. Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems.

We introduce a novel approach to solving dynamic programming problems, such as those in many economic models, on a quantum annealer, a specialized device that performs combinatorial optimization ...

It is proved that there exist stationary optimal plans for discounted dynamic programming problems, and that there exist semi-Markov ∈-optimal plans for positive dynamic programming problems. The ...

This course covers reinforcement learning aka dynamic programming, which is a modeling principle capturing dynamic environments and stochastic nature of events. The main goal is to learn dynamic ...

Dynamic optimization and optimal control problems form the backbone of numerous applications in engineering, economics and the natural sciences. These methodologies involve determining a time ...

We consider a broad class of stochastic dynamic programming problems that are amenable to relaxation via decomposition. These problems comprise multiple subproblems that are independent of each other ...

In competitive programming, there is a common pattern for solving dynamic programming problems recursively (top-down) in c++.