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 |
| DOIs | |
| Publication status | Published - 1998 Oct 5 |
Keywords
- A pyramidal tour
- Polynomially solvable classes
- The traveling salesman problem
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Pyramidal tours with step-backs and the asymmetric traveling salesman problem'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS