References
Yvan Dumas, Jacques Desrosiers, Eric Gelinas, and Marius M Solomon. An optimal algorithm for the traveling salesman problem with time windows. Operations Research, 43(2):367–371, 1995. doi:10.1287/opre.43.2.367.
Ryo Kuroiwa and J. Christopher Beck. Solving domain-independent dynamic programming problems with anytime heuristic search. In Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS). 2023.
Maria Garcia de la Banda, Peter J. Stuckey, and Geoffrey Chu. Solving talent scheduling with dynamic programming. INFORMS Journal on Computing, 23(1):120–137, 2011. doi:10.1287/ijoc.1090.0378.
Geoffrey Chu and Peter J. Stuckey. Minimizing the maximum number of open stacks by customer search. In Ian P. Gent, editor, Principles and Practice of Constraint Programming - CP 2009, 242–257. 2009.
Ryo Kuroiwa and J. Christopher Beck. Domain-independent dynamic programming: generic state space search for combinatorial optimization. In Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS). 2023.
J. Gromicho, J. J. Van Hoorn, A. L. Kok, and J. M.J. Schutten. Restricted dynamic programming: a flexible framework for solving realistic vrps. Computers and Operations Research, 39(5):902–909, 2012. URL: http://dx.doi.org/10.1016/j.cor.2011.07.002, doi:10.1016/j.cor.2011.07.002.
E. C. Sewell and S. H. Jacobson. A branch, bound, and remember algorithm for the simple assembly line balancing problem. INFORMS Journal on Computing, 24(3):433–442, 6 2012. doi:10.1287/ijoc.1110.0462.
Michael Morin, Margarita P. Castro, Kyle E.C. Booth, Tony T. Tran, Chang Liu, and J. Christopher Beck. Intruder alert! optimization models for solving the mobile robot graph-clear problem. Constraints, 23(3):335–354, 2018. doi:10.1007/s10601-018-9288-3.
T.S. Abdul-Razaq, C.N. Potts, and L.N. Van Wassenhove. A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Applied Mathematics, 26(2):235–253, 1990. URL: https://www.sciencedirect.com/science/article/pii/0166218X9090103J, doi:https://doi.org/10.1016/0166-218X(90)90103-J.