TY - JOUR
T1 - Pyramidal tours with step-backs and the asymmetric traveling salesman problem
AU - Enomoto, Hikoe
AU - Oda, Yoshiaki
AU - Ota, Katsuhiro
PY - 1998/10/5
Y1 - 1998/10/5
N2 - 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.
AB - 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.
KW - A pyramidal tour
KW - Polynomially solvable classes
KW - The traveling salesman problem
UR - http://www.scopus.com/inward/record.url?scp=0007628656&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0007628656&partnerID=8YFLogxK
U2 - 10.1016/S0166-218X(98)00048-1
DO - 10.1016/S0166-218X(98)00048-1
M3 - Article
AN - SCOPUS:0007628656
SN - 0166-218X
VL - 87
SP - 57
EP - 65
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 1-3
ER -