[See also the genetic algorithms folder.]
---------------------------------------------------------------------
David Applegate a.o.: On the solution of the traveling salesman problem.
Doc. Math. Extra Vol. Proc. ICM 1998 (1998), 645-656.

Richard Bellman: Dynamic programming treatment of the traveling
salesman problem. J. ACM 9 (1962), 61-63.

M. Bellmore/J. Malone: Pathology of traveling salesman subtour
elimination algorithms. Oper. Res. 19 (1971), 278-307.

M. Bellmore/G. Nemhauser: The traveling salesman problem - a survey.
Oper. Res. 16 (1968), 538-558.

J. Bentley: Experiments on travelin salesman heuristics.
Proc. 1st SIAM Symp. Discr. Algg. (1990), 91-99.

Rainer Burkard a.o.: Well-solvable special cases of the traveling
salesman problem. SIAM Rev. 40 (1998), 496-546.

W. Cook/M. Hartmann: On the complexity of branch and cut methods
for the traveling salesman problem. In Cook/Seymour 1990, 75-81.

W. Cook/P. Seymour (ed.): Polyhedral combinatorics. AMS 1990.

H. Crowder/M. Padberg: Solvin large-scale symmetric traveling
salesman problems to optimality. Management Sci. 26 (1980), 495-509.

G. Dantzig/D. Fulkerson/S. Johnson: Solution of a large-scale
traveling salesman problem. Oper. Res. 2 (1954), 393-410.

10339 Vladimir Deineko/Rene' van Dal/Gu''nter Rote: The convex-hull-and-line
traveling salesman problem - a solvable case.
TU Graz Report 233 (1992).

Mauro Dell'Amico a.o. (ed): Annotated bibliographies in combinatorial
optimization. Wiley 1997.

G. Dueck: New optimization heuristics - the great deluge algorithm
and record-to-record travel. J. Comp. Physics 104 (1993), 86-92.

G. Dueck/T. Scheuer: Threshold accepting - a general purpose
optimization algorithm superior to simulated annealing.
J. Comp. Phys. 90 (1990), 161-175.'

11063 M. Fredman/David Johnson/Lyle McGeoch/G. Ostheimer: Data structures
for traveling salesmen. J. Algorithms 18 (1995), 432-479.

M. Gro''tschel: On the symmetric traveling salesman problem.
Solution of a 120-city problem. Math. Progr. Studies 12 (1980), 61-77.

12465 Martin Gro''tschel/Manfred Padberg: Die optimierte Odyssee.
Spektrum 1999/4, 76-83.

15239 Dan Gusfield/Richard Karp/Lusheng Wang/Paul Stelling: Graph traversals,
genes and matroids - an efficient case of the travelling salesman problem.
Discrete Appl. Math. 88 (1998), 167-180.

11062 David Johnson/Lyle McGeoch: The travelingg salesman problem -
a case study in local optimization. Internet 1995, 103p.

11064 David Johnson/Lyle McGeoch/E. Rothberg: Asymptotic experimental
analysis for the Held-Karp traveling salesman bound.
Proc. 7th Annual ACM-SIAM Symp. Discrete Algor. (1996), 341-350.

Michael Ju''nger/Gerhard Reinelt/Giovanni Rinalid: The travelling salesman
problem. In Dell'Amico a.o. 1997, 199-221.

E. Lawler/J. Lenstra/A. Rinnooy Kan/D. Shmoys (ed.): The traveling salesman
problem. A guided tour of combinatorial optimization. Wiley 1985.

S. Lin: Computer solutions of the traveling salesman problem.
Bell Systems Techn. J. 44 (1965), 2245-2269.

S. Lin/B. Kernighan: An effective heuristic algorithm for the traveling
salesman problem. Oper. Res. 31 (1973), 498-516.

J. Little/K. Murty/D. Sweeney/C. Karel: An algorithm for the traveling
salesman problem. Oper. Res. 11 (1963), 972-989.

I. Or: Traveling salesman-type combinatorial problems and their relations
to the logistics of regional blood banking. PhD thesis Evanston 1976.

M. Padberg/S. Hong: On the symmetric traveling salesman problem -
computational study. Math. Progr. Studies 12 (1980), 78-107.

M. Padberg/M. Rao: The traveling salesman problem and a class of
polyhedra of diameter two. Math. Progr. 7 (1974), 32-45.

M. Padberg/G. Rinaldi: Optimization of a 532-city symmetric traveling
salesman problem. Oper. Res. Letters 6 (1987), 1-7.

M. Padberg/G. Rinaldi: A branch-and-cut algorithm for the resolution
of large-scale traveling salesman problems. SIAM Rev. 33 (1991), 60-100.

M. Padberg/T. Sung: An analytical comparison of different formulations
of the traveling salesman problem. Math. Progr. 52 (1991), 315-357.

C. Papadimitriou: The adjacency relation on the traveling salesman
polytope is NP-complete. Math. Progr. 14 (1978), 312-324.

C. Papadimitriou: The complexity of the Lin-Kernighan heuristic
for the traveling salesman problem. SIAM J. Comp. 21 (1992), 450-465.

C. Papadimitriou/K. Steiglitz: On the complexity of local search
for the traveling salesman problem. SIAM J. Comp. 6 (1977), 76-83.

C. Papadimitriou/K. Steiglitz: Some examples of difficult traveling
salesman problems. Oper. Res. 26 (1978), 434-443.

C. Papadimitriou/K. Steiglitz: Combinatorial optimization. Algorithms
and complexity. Prentice Hall 1982.

5964 Carsten Peterson: Parallel distributed approaches to combinatorial
optimization. Benchmark studies on traveling salesman problem.
Neural Comp. 2 (1990), 261-269.

G. Reinelt: The traveling salesman. 
Springer 1994, 220p. 3'540-58334-3. DM 52.

D. Rosenkranz/E. Stearns/P. Lewis: An analysis of several heuristics
for the traveling salesman problem. SIAM J. Comp. 6 (1977), 563-581.

10338 Gu''nter Rote: The N-line traveling salesman problem.
TU Graz Report 109 (1991).