Examples

On our repository, we provide example Jupyter notebooks of DP models for combinatorial optimization problems used in this document, Kuroiwa and Beck [7], and Kuroiwa and Beck [2].

• Knapsack problem

• Traveling salesperson problem with time windows (TSPTW) : the DP model is based on Dumas et al. [1].

• Capacitated vehicle routing problem (CVRP) : the DP model is based on Gromicho et al. [8].

• Multi-commodity pick-and-delivery traveling salesperson problem (m-PDTSP)

• Simple assembly line balancing problem (SALBP-1) : the DP model is based on Sewell and Jacobson [9].

• Bin packing

• Minimization of open stacks problem (MOSP) : the DP model is based on Chu and Stuckey [4].

• Graph-clear : the DP model is based on the state-based formula in Morin et al. [5].

• Talent scheduling : the DP model is based on Garcia de la Banda et al. [3].

• Single machine total weighted tardiness with precedence : the DP model is based on Abdul-Razaq et al. [10].