1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, Prentice Hall (1993)
2. Alekhnovich, M., Borodin, A., Buresh-Oppenheim, J., Impagliazzo, R., Magen, A., Pitassi, T.: Toward a model for backtracking and dynamic programming. In: Twentieth Annual IEEE Conference on Computational Complexity, pp. 308–322 (2005)
3. Balas, E., Simonetti, N.: Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study. INFORMS J. Comput. 13(1), 56–75 (2001)
4. Bertsekas, D.: Dynamic Programming and Optimal Control. Athena Scientific, Belmont (2000)
5. Bompadre, A.: Three essays on sequencing and routing problems. PhD thesis, Massachusetts Institute of Technology, USA (2005)