View on Coursera Course Description This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic ...

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

We present a dynamic programming algorithm for solving this so-called single-sink, fixed-charge, multiple-choice transportation problem exactly. The method exploits heuristics and lower bounds to ...

Programming is Problem Solving When we bring programming to math class, we add a new layer of problem solving: translating mathematical problems/ideas to execute them in code. This often requires ...

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