The \(x\)-and-\(y\)-axes travelling salesman problem

DOI10.1016/j.ejor.2012.06.036zbMath1292.90244MaRDI QIDQ2253351

Eranda Çela, Gerhard J. Woeginger, Vladimir G. Deǐneko

Publication date: 27 July 2014

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.06.036

zbMATH Keywords

computational complexity; combinatorial optimization; polynomial-time algorithm; Euclidean travelling salesman problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C27: Combinatorial optimization

Related Items

Uncertain multiobjective traveling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Pyramidal tours and the traveling salesman problem
• Euclidean TSP between two nested convex obstacles
• The Euclidean traveling salesman problem is NP-complete
• Testing the necklace condition for shortest tours and optimal factors in the plane
• Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
• The convex-hull-and-line traveling salesman problem: A solvable case
• The Convex-hull-and-k-line Travelling Salesman Problem
• An asymmetric analog of van der Veen conditions and the traveling salesman problem. II
• Multiobjective traveling salesperson problem on Halin graphs
• A review of TSP based approaches for flowshop scheduling
• A polynomial algorithm for a constrained traveling salesman problem
• Efficient special case algorithms for the n-line planar traveling salesman problem
• The n-line traveling salesman problem
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• The Traveling-Salesman Problem