Pyramidal tours with step-backs and the asymmetric traveling salesman problem

Hikoe Enomoto, Yoshiaki Oda, Katsuhiro Ota

Research output: Contribution to journalArticle

10 Citations (Scopus)

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 languageEnglish
Pages (from-to)57-65
Number of pages9
JournalDiscrete Applied Mathematics
Volume87
Issue number1-3
Publication statusPublished - 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