1. Bellman, R., Dynamic Programming, Princeton: Princeton Univ. Press, 1957.
2. Posypkin, M.A. and Sigal, I.Kh., Speedup Estimates for Some Variants of the Parallel Implementations of the Branch-and-Bound Method, J. Math. Math. Phys., 2006, vol. 46, no. 12, pp. 2189–2202.
3. O’Neil, E.T. and Kerlin, S., A Simple 2O( v x) Algorithm for PARTITION and SUBSET SUM, 2010, http://www.lidi.info.unlp.edu.ar/WorldComp2011-Mirror/FCS8171.pdf.
4. Lazarev, A.A. and Werner, F., A Graphical Realization of the Dynamic Programming Method for Solving NP-Hard Combinatorial Problems, Comput. Math. Appl., 2009, vol. 58, no. 4, pp. 619–631.
5. Gafarov, E.R., Lazarev, A.A., and Werner, F., Transforming a Pseudo-Polynomial Algorithm for the Single Machine Total Tardiness Maximization Problem into a Polynomial One, Ann. Oper. Res., 2012, vol. 196, no. 1, pp. 247–261.