1. Dynamic Programming, Princeton U. P., Princeton, 1958.
2. , and , “Exact Algorithms for the TSP with Additional Constraints”, Imperial College Internal Report No. IC, OR, 80, 23, September 1979.
3. , and , “State-space Relaxations for Combinatorial Problems”, Imperial College Internal Report No. IC, OR, 79, 09, July 1979.
4. , and , “Exact Algorithms for the Vehicle Routing Problem, Based on Spanning Trees and Shortest Path Relaxations”, Math. Program., to appear.
5. “The Traveling Salesman Problem”, in Combinatorial Optimization, , and , Eds., Wiley, London, 1979.