| 3 | -- | 19 | Egon Balas, Robert Carr, Matteo Fischetti, Neil Simonetti. New facets of the STS polytope generated from known facets of the ATS polytope |
| 20 | -- | 32 | Hanif D. Sherali, Subhash C. Sarin, Pei-Fang Tsai. A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints |
| 33 | -- | 49 | Vicky Mak, Natashia Boland. Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs |
| 50 | -- | 62 | Alexander Grigoriev, Joris van de Klundert. On the high multiplicity traveling salesman problem |
| 63 | -- | 77 | Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma. Iterative patching and the asymmetric traveling salesman problem |
| 78 | -- | 85 | Özlem Ergun, James B. Orlin. A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem |
| 86 | -- | 94 | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo. Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs |