7. Conclusions
We have discussed an implementation of a linear-time dynamic-programming algorithm for solving TSPs with a special type of precedence constraints.
We have applied our procedure to solving TSPs with time windows, originating in scheduling prob- lems with setup, release and delivery times, in truck delivery problems, and in stacker-crane routing. We present extensive computational evidence for our claim that on these classes of problems our procedure brings an improvement to the state of the art.