Lexicographically minimizing axial motions for the Euclidean TSP

DOI10.1007/S10878-008-9154-0MaRDI QIDQ2268758zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

shortest pathtraveling salesman problemlexicographical optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

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

Cites work

• scientific article; zbMATH DE number 432754 (Why is no real title available?)
• scientific article; zbMATH DE number 3576997 (Why is no real title available?)
• scientific article; zbMATH DE number 6472595 (Why is no real title available?)
• Efficient special case algorithms for the n-line planar traveling salesman problem
• The traveling salesman problem and its variations
• The traveling salesman problem. A computational study.
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

Describes a project that uses

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)