Pyramidal tours and the traveling salesman problem

DOI10.1016/0377-2217(91)90339-WMaRDI QIDQ809904zbMATH OpenOpenAlexFDO

Authors Jack A. A. van der Veen, Gerard Sierksma, René van Dal

Publication date 1991

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(91)90339-w

zbMATH Keywords

heuristicstraveling salesmanDemidenko conditionsshortest Hamiltonian tourshortest pyramidal tour

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
• An asymmetric analogue of van der Veen conditions and the traveling salesman problem
• Pyramidal tours for the traveling salesman
• Pyramidal tours with step-backs and the asymmetric traveling salesman problem
• A new asymmetric pyramidally solvable class of the traveling salesman problem

Cites work

• scientific article; zbMATH DE number 3918121 (Why is no real title available?)
• scientific article; zbMATH DE number 4027206 (Why is no real title available?)
• scientific article; zbMATH DE number 3632217 (Why is no real title available?)
• Time-slot assignment for TDMA-systems

Cited in

(17)

• Pyramidal tours for the traveling salesman
• A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
• Pyramidal tours and multiple objectives
• On the traveling salesman problem with a relaxed Monge matrix
• An asymmetric analogue of van der Veen conditions and the traveling salesman problem
• Algorithmic aspects of pyramidal tours with restricted jump-backs
• Pyramidal traveling salesman problem
• The \(x\)-and-\(y\)-axes travelling salesman problem
• Generalized pyramidal tours for the generalized traveling salesman problem
• A new asymmetric pyramidally solvable class of the traveling salesman problem
• Characterizing bipartite Toeplitz graphs
• On the skeleton of the polytope of pyramidal tours
• Characterizing the integrality gap of the subtour LP for the circulant traveling salesman problem
• A branch-and-bound algorithm for the singly constrained assignment problem
• An asymmetric analog of van der Veen conditions and the traveling salesman problem. II
• Pyramidal tours with step-backs and the asymmetric traveling salesman problem
• Subclasses of solvable problems from classes of combinatorial optimization problems

This page was built for publication: Pyramidal tours and the traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809904)