Pyramidal tours and the traveling salesman problem

DOI10.1016/0377-2217(91)90339-WzbMath0732.90084OpenAlexW2034489885MaRDI QIDQ809904

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

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)

Related Items (11)

A new asymmetric pyramidally solvable class of the traveling salesman problem ⋮ Pyramidal tours and multiple objectives ⋮ A branch-and-bound algorithm for the singly constrained assignment problem ⋮ The \(x\)-and-\(y\)-axes travelling salesman problem ⋮ An asymmetric analogue of van der Veen conditions and the traveling salesman problem ⋮ Characterizing bipartite Toeplitz graphs ⋮ Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem ⋮ Pyramidal tours with step-backs and the asymmetric traveling salesman problem ⋮ Subclasses of solvable problems from classes of combinatorial optimization problems ⋮ An asymmetric analog of van der Veen conditions and the traveling salesman problem. II ⋮ Pyramidal tours for the traveling salesman

Cites Work

• Time-slot assignment for TDMA-systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

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