Novel concave hull-based heuristic algorithm for TSP (Q2139346): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s43069-022-00137-9
+Normal rank
@@ Property / OpenAlex ID @@
+W4223922607
@@ Property / OpenAlex ID: W4223922607 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4845366
@@ Property / cites work: Q4845366 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5392120
@@ Property / cites work: Q5392120 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4461903
@@ Property / cites work: Q4461903 / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem
@@ Property / cites work: The Traveling-Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Method for Solving Traveling-Salesman Problems
@@ Property / cites work: A Method for Solving Traveling-Salesman Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamental Problems in Computing
@@ Property / cites work: Fundamental Problems in Computing / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations.
+Normal rank
@@ Property / cites work @@
+Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
+Normal rank
@@ Property / cites work @@
+TSP heuristics: domination analysis and complexity
+Normal rank
@@ Property / cites work @@
+Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
+Normal rank
@@ Property / cites work @@
+Spacefilling curves and the planar travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Efficient generation of simple polygons for characterizing the shape of a set of points in the plane
+Normal rank
@@ Property / cites work @@
+The convex-hull-and-line traveling salesman problem: A solvable case
+Normal rank
@@ Property / cites work @@
+The Convex-hull-and-k-line Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+On the convex layers of a planar set
@@ Property / cites work: On the convex layers of a planar set / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
+Normal rank
@@ Property / cites work @@
+Good triangulations yield good tours
@@ Property / cites work: Good triangulations yield good tours / rank @@
+Normal rank
@@ Property / cites work @@
+Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
+Normal rank
@@ Property / cites work @@
+Traveling salesman cycles are not always subgraphs of Voronoi duals
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for multi-criteria traveling salesman problems
+Normal rank
@@ Property / cites work @@
+The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
+Normal rank
@@ Property / cites work @@
+A simple method for resolving degeneracies in Delaunay triangulations
+Normal rank
@@ Property / cites work @@
+Minimax Estimation of the Volume of a Set Under the Rolling Ball Condition
+Normal rank
@@ Property / cites work @@
+Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs
+Normal rank
@@ Property / cites work @@
+Hard to solve instances of the Euclidean traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of a new heuristic for the travelling salesman problem
+Normal rank