On the Traveling Salesman Problem with Simple Temporal Constraints
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem