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.

To solve the problem of time-cost tradeoff in project management with available models, a choice must be made between heuristic approaches and algorithms based upon restrictive assumptions about the ...

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.

SIAM Journal on Applied Mathematics, Vol. 15, No. 3 (May, 1967), pp. 693-718 (26 pages) This paper develops a formalism within which the application of dynamic programming to discrete, deterministic ...