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 ...

This paper considers a minimum-cost network flow problem in a bipartite graph with a single sink. The transportation costs exhibit a staircase cost structure because such types of transportation cost ...

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.

Lars M. Hvattum, Arne Løkketangen, Gilbert Laporte, Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic, Transportation Science, Vol. 40, No. 4 (November ...