Pyramidal tours and the traveling salesman problem

DOI10.1016/0377-2217(91)90339-WzbMATH Open0732.90084OpenAlexW2034489885MaRDI QIDQ809904FDOQ809904

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• An asymmetric analogue of van der Veen conditions and the traveling salesman problem
• On the traveling salesman problem with a relaxed Monge matrix
• Algorithmic aspects of pyramidal tours with restricted jump-backs
• The \(x\)-and-\(y\)-axes travelling salesman problem
• Pyramidal traveling salesman problem
• Generalized pyramidal tours for the generalized traveling salesman problem
• Characterizing bipartite Toeplitz graphs
• A new asymmetric pyramidally solvable class of the traveling salesman problem
• 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)