TRAVELING SALESMAN PROBLEM OF SEGMENTS

DOI10.1142/S0218195904001342MaRDI QIDQ4818594zbMATH OpenOpenAlexFDO

Authors Jinhui Xu, Zhiyong Lin, Yang Yang, Ronald Berezney

Publication date 29 September 2004

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195904001342

zbMATH Keywords

Algorithmtraveling salesman problempolynomial time approximation scheme

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Traveling salesman problem of segments
• scientific article; zbMATH DE number 1163704
• Experimental comparison of two heuristic algorithms for one generalization of the large-scale planar travelling-salesman problem
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• The metric problem of the travelling salesman for segments

Cites work

• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• A polynomial time approximation scheme for the problem of interconnecting highways
• Approximation algorithms for the Geometric Covering Salesman Problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• Fast Heuristics for Large Geometric Traveling Salesman Problems
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• The Traveling Salesman Problem with Distances One and Two

Cited in

(6)

• scientific article; zbMATH DE number 3882232 (Why is no real title available?)
• The metric problem of the travelling salesman for segments
• A polynomial algorithm for a constrained traveling salesman problem
• scientific article; zbMATH DE number 1757971 (Why is no real title available?)
• Experimental comparison of two heuristic algorithms for one generalization of the large-scale planar travelling-salesman problem
• Traveling salesman problem of segments

This page was built for publication: TRAVELING SALESMAN PROBLEM OF SEGMENTS

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