### 15 papers:

- CASE-2015-LiDLZ #approach #composition #problem
- A decomposition approach to colored traveling salesman problems (JL, XD, HL, MZ), pp. 51–56.
- ICALP-v1-2013-MuchaS #problem #scheduling #symmetry
- No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (MM, MS), pp. 769–779.
- STOC-2012-BartalGK #approximate #polynomial #problem
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (YB, LAG, RK), pp. 663–672.
- ICALP-A-2008-BjorklundHKK #bound #graph #problem
- The Travelling Salesman Problem in Bounded Degree Graphs (AB, TH, PK, MK), pp. 198–209.
- OOPSLA-2007-Meijer #programming language
- Confessions of a used programming language salesman (EM), pp. 677–694.
- ICPR-v2-2004-RayBP #algorithm #problem #search-based
- New Operators of Genetic Algorithms for Traveling Salesman Problem (SSR, SB, SKP), pp. 497–500.
- STOC-2000-PapadimitriouV #on the #problem
- On the approximability of the traveling salesman problem (extended abstract) (CHP, SV), pp. 126–133.
- SAC-2000-GottliebK #algorithm #problem
- Selection in Evolutionary Algorithms for the Traveling Salesman Problem (JG, TK), pp. 415–421.
- SAC-1999-KatayamaN #algorithm #problem #search-based #using
- A New Iterated Local Search Algorithm Using Genetic Crossover for the Traveling Salesman Problem (KK, HN), pp. 302–306.
- ICML-1995-GambardellaD #approach #learning #named #problem
- Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem (LMG, MD), pp. 252–260.
- SAC-1995-Julstrom #algorithm #problem #search-based
- Very greedy crossover in a genetic algorithm for the traveling salesman problem (BAJ), pp. 324–328.
- ICALP-1990-Johnson #optimisation #problem
- Local Optimization and the Traveling Salesman Problem (DSJ), pp. 446–461.
- STOC-1976-PapadimitriouS #complexity #problem
- Some Complexity Results for the Traveling Salesman Problem (CHP, KS), pp. 1–9.
- STOC-1973-WeinerSB #algorithm
- Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient (PW, SLS, AB), pp. 207–213.
- DAC-1970-KrolakFM #approach #problem #towards
- A man-machine approach toward solving the traveling salesman problem (PDK, WF, GM), pp. 250–264.