Cylces Contribution) for the traveling salesman problem,
describe a dynamic-programming implementation of the strategy
for 2-dimensional Euclidean instances, and report some experimental
results. We also discuss some theoretical problems related to
the strategy.