Examples ======== On our `repository `_, we provide example Jupyter notebooks of DP models for combinatorial optimization problems used in this document, :cite:t:`DIDPFirst`, and :cite:t:`DIDPAnytime`. * `Knapsack problem `_ * `Traveling salesperson problem with time windows (TSPTW) `_ : the DP model is based on :cite:t:`Dumas1995`. * `Capacitated vehicle routing problem (CVRP) `_ : the DP model is based on :cite:t:`Gromicho2012`. * `Multi-commodity pick-and-delivery traveling salesperson problem (m-PDTSP) `_ * `Simple assembly line balancing problem (SALBP-1) `_ : the DP model is based on :cite:t:`Sewell2012`. * `Bin packing `_ * `Minimization of open stacks problem (MOSP) `_ : the DP model is based on :cite:t:`Chu2009`. * `Graph-clear `_ : the DP model is based on the state-based formula in :cite:t:`Morin2018`. * `Talent scheduling `_ : the DP model is based on :cite:t:`GarciaDeLaBanda2011`. * `Single machine total weighted tardiness with precedence `_ : the DP model is based on :cite:t:`AbdulRazaq1990`.