Lower Bounds for Insertion Methods for TSP
From MaRDI portal
Recommendations
- Not all insertion methods yield constant approximate tours in the Euclidean plane
- Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem
- Separating subadditive Euclidean functionals
- Separating subadditive Euclidean functionals
- Improving Christofides' lower bound for the traveling salesman problem
Cites work
- A geometric problem involving the nearest neighbour algorithm
- A problem seminar
- A travelling salesman problem in the \(k\)-dimensional unit cube
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Approximate Traveling Salesman Algorithms
- Dynamic Steiner Tree Problem
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On-line Steiner trees in the Euclidean plane
Cited in
(8)- Estimating the Held-Karp lower bound for the geometric TSP
- Not all insertion methods yield constant approximate tours in the Euclidean plane
- Constructing competitive tours from local information
- An explicit lower bound for TSP with distances one and two
- A lower bound for the job insertion problem.
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
- Improved lower bounds for the universal and a priori TSP
- Truly tight bounds for TSP heuristics
This page was built for publication: Lower Bounds for Insertion Methods for TSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4314147)
