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