E. Balas and N. Simonetti: “Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs:
A Computational Study”
R. Bellman: “Dynamic Programming Treatment of the Travelling Salesman Problem”
J. Bentley: “Algorithm Design Techniques”
D. S. Hirschberg: “A Linear Space Algorithm for Computing Maximal Common Subsequences”
A. Levitin: “Do We Teach the Right Algorithm Design Techniques”