scientific article; zbMATH DE number 4199979

zbMATH Open0726.90071MaRDI QIDQ3348715FDOQ3348715

Authors: Cheng'en Yang 

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• Worst-case analysis of a new heuristic for the travelling salesman problem
• Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem
• A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
• Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
• Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems
• Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem
• Worst-case comparison of valid inequalities for the TSP
• scientific article; zbMATH DE number 1855663
• Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
• An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane

zbMATH Keywords

heuristicworst case analysisEuclidean travelling salesmanlargest angle method

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited In (2)

• Geometric and LP-based heuristics for angular travelling salesman problems in the plane
• Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems

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 Q3348715)