A new asymmetric pyramidally solvable class of the traveling salesman problem
From MaRDI portal
Publication:867920
DOI10.1016/j.orl.2005.12.001zbMath1112.90063OpenAlexW1964080702MaRDI QIDQ867920
Publication date: 19 February 2007
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.12.001
Related Items (2)
Multiobjective traveling salesperson problem on Halin graphs ⋮ Pyramidal tours and multiple objectives
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pyramidal tours and the traveling salesman problem
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
- Pyramidal tours with step-backs and the asymmetric traveling salesman problem
- Gilmore-Gomory type traveling salesman problems
- Pyramidal traveling salesman problem
- Special cases of the traveling salesman problem
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- An asymmetric analog of van der Veen conditions and the traveling salesman problem. II
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
- The traveling salesman problem and its variations
- The maximum traveling salesman problem on van der Veen matrices
- The maximum travelling salesman problem on symmetric Demidenko matrices
- New exponential neighbourhood for polynomially solvable TSPs
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
- Pyramidal tours for the traveling salesman
- A new heuristic for the traveling salesman problem
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- An asymmetric analogue of van der Veen conditions and the traveling salesman problem
This page was built for publication: A new asymmetric pyramidally solvable class of the traveling salesman problem