Skip to content

Interactive lab

Here you can get your hands on dynamic programming: each app fills the table of a DP algorithm step by step on the reference instances of the course, which you can also change. Pick an app: it opens full page. Everything runs in the browser; the numbers are computed by the algorithm, not typed by hand.

Knapsack problems

  • DP tables for the knapsack problems


    0/1, unbounded, bounded knapsack and subset sum: the table fills one cell at a time, with the cells it depends on; then the reconstruction of the solution.

    Open the app →

Lot sizing problems

  • Wagner-Whitin for uncapacitated lot sizing


    The recurrence v(t) tries every period of the last production run: a shortest path in the network of the production runs, then the optimal plan.

    Open the app →