This note deals with the manner in which dynamic problems, involving probabilistic constraints, may be tackled using the ideas of Lagrange multipliers and efficient solutions. Both the infinite and ...

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.

Building on the recent successes of approximate dynamic programming (ADP) for road-based applications within the transportation community, we develop an ADP procedure to generate good solutions to ...

This paper uses using a quantum annealer (a specialized device that performs combinatorial optimization) to solve dynamic programming problems, particularly those of many economic models.