Lexicographically minimizing axial motions for the Euclidean TSP

DOI10.1007/S10878-008-9154-0zbMATH Open1183.90346OpenAlexW2090253716MaRDI QIDQ2268758FDOQ2268758

Authors: Francis Sourd 

Publication date: 9 March 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9154-0

Recommendations

• The \(x\)-and-\(y\)-axes travelling salesman problem
• The n-line traveling salesman problem
• Euclidean TSP on two polygons
• Simple algorithms for gilmore-gomory's traveling salesman and related problems
• Three easy special cases of the euclidean travelling salesman problem

zbMATH Keywords

shortest pathtraveling salesman problemlexicographical optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• The traveling salesman problem. A computational study.
• The traveling salesman problem and its variations
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Efficient special case algorithms for the n-line planar traveling salesman problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• Concorde

This page was built for publication: Lexicographically minimizing axial motions for the Euclidean TSP

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