Traveling salesman problem of segments

DOI10.1007/3-540-45071-8_6MaRDI QIDQ3082911zbMATH OpenOpenAlexFDO

Authors Jinhui Xu, Yang Yang, Zhiyong Lin

Publication date 18 March 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45071-8_6

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

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

Cited in

(5)

• Experimental comparison of two heuristic algorithms for one generalization of the large-scale planar travelling-salesman problem
• Distances between traveling salesman tours
• The metric problem of the travelling salesman for segments
• scientific article; zbMATH DE number 1163704 (Why is no real title available?)
• 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 Q3082911)