scientific article; zbMATH DE number 1145369

MaRDI QIDQ4384666zbMATH OpenFDO

Authors Peide Zhou

Publication date 26 April 1998

zbMATH Keywords

algorithmic complexitygeometrical algorithmtravelling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Fast Algorithms for Geometric Traveling Salesman Problems
• The traveling salesman problem with few inner points
• An approximation algorithm for the TSP
• scientific article; zbMATH DE number 1305423

Cited in

(7)

• Geometric and LP-based heuristics for angular travelling salesman problems in the plane
• Simple algorithms for gilmore-gomory's traveling salesman and related problems
• scientific article; zbMATH DE number 5823729 (Why is no real title available?)
• scientific article; zbMATH DE number 4031726 (Why is no real title available?)
• Fast Algorithms for Geometric Traveling Salesman Problems
• Fast Heuristics for Large Geometric Traveling Salesman Problems
• scientific article; zbMATH DE number 1054956 (Why is no real title available?)

This page was built for publication:

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