N. Christofides, A. Mingozzi and P. Toth, Space state relaxation procedures for the computation of bounds to routing problems, Networks 11(1981)145.
A. Croes, A method for solving traveling salesman problems, Oper. Res. 5(1958)791.
M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
P.C. Kanellakis and C.H. Papadimitriou, Local search for the asymmetric traveling salesman problem, Oper. Res. 28(1980)1086.
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (eds.),The Traveling Salesman Problem (Wiley, Chichester, 1985).
S. Lin, Computer solutions to the traveling salesman problem, Bell System Tech. J. 44(1965)2245.
S. Lin and B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Oper. Res. 21(1973)498.
I. Or,Traveling Salesman-type Combinatorial Problems and Their Relation to the Logistics of Blood Banking, Ph.D. Thesis, Dept. of Industrial Engineering and Management Sciences, Northwestern University (1976).
C.H. Papadimitriou and K. Steiglitz, Some examples of difficult traveling salesman problems, Oper. Res. 26(1978)434.
H.N. Psaraftis,k-interchange procedures for local search in a precedence-constrained routing problem, Eur. J. Oper. Res. 13(1983)391.
T.H.C. Smith and G.L. Thompson, A LIFO implicit enumeration search algorithm for the symmetric traveling salesman problem using Held and Karp's 1-tree relaxarion, Ann. Discrete Math. 1(1977)479.
M.M. Solomon, Vehicle routing and scheduling with time window constraints: Models and algorithms, Working Paper 83-02-01, Dept. of Decision Sciences, University of Pennsylvania (1983).
M.M. Solomon, On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints, Working Paper 83-05-03, Dept. of Decision Sciences, University of Pennsylvania (1983).