Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem
From MaRDI portal
Publication:2367039
Recommendations
Cites work
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- scientific article; zbMATH DE number 3918121 (Why is no real title available?)
- scientific article; zbMATH DE number 3950233 (Why is no real title available?)
- scientific article; zbMATH DE number 3799403 (Why is no real title available?)
- Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem
Cited in
(6)- Quantizers ad the worst case Euclidean traveling salesman problem
- Novel concave hull-based heuristic algorithm for TSP
- Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem
- scientific article; zbMATH DE number 4199979 (Why is no real title available?)
- WORST-CASE ANALYSIS FOR PLANAR MATCHING AND TOUR HEURISTICS WITH BUCKETING TECHNIQUES AND SPACEFILLING CURVES
- Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems
This page was built for publication: Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367039)