Abstract
In this paper, we introduce the notion of a pyramidal tour with step-backs which is an extension of a pyramidal tour. By using this idea we shall show that for a class of distance matrices an optimal tour of traveling salesman problem can be computed in polynomial time.
| Original language | English |
|---|---|
| Pages (from-to) | 57-65 |
| Number of pages | 9 |
| Journal | Discrete Applied Mathematics |
| Volume | 87 |
| Issue number | 1-3 |
| Publication status | Published - 1998 Oct 5 |
Fingerprint
Keywords
- A pyramidal tour
- Polynomially solvable classes
- The traveling salesman problem
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Applied Mathematics
- Discrete Mathematics and Combinatorics
- Theoretical Computer Science
Cite this
Enomoto, H., Oda, Y., & Ota, K. (1998). Pyramidal tours with step-backs and the asymmetric traveling salesman problem. Discrete Applied Mathematics, 87(1-3), 57-65.