1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton Univ. Press, Princeton (2006)
2. Bailey, M., Alden, J., Smith, R.L.: Approximate dynamic programming using epsilon-pruning (working paper). TR, University of Michigan, Ann Arbor (2002)
3. Lecture Notes in Computer Science;A. Björklund,2008
4. Lecture Notes in Computer Science;J. Chen,2003
5. Lecture Notes in Computer Science;S. Dube,1993