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

DOI10.1016/S0166-218X(98)00048-1zbMath0910.90260OpenAlexW2002016358WikidataQ127725425 ScholiaQ127725425MaRDI QIDQ1270772

Hikoe Enomoto, Katsuhiro Ota, Yoshiaki Oda

Publication date: 13 December 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

traveling salesmanpyramidal tourdistance matricespolynomially solvable classes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

The assignment problem with nearly Monge arrays and incompatible partner indices ⋮ A new asymmetric pyramidally solvable class of the traveling salesman problem ⋮ An asymmetric analogue of van der Veen conditions and the traveling salesman problem ⋮ Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] ⋮ Traveling salesman games with the Monge property ⋮ An asymmetric analog of van der Veen conditions and the traveling salesman problem. II

Cites Work

• Pyramidal tours and the traveling salesman problem
• A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Pyramidal tours with step-backs and the asymmetric traveling salesman problem