A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem (Q1628059): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2018.07.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2884583022
@@ Property / OpenAlex ID: W2884583022 / rank @@
+Normal rank
@@ Property / cites work @@
+An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+A novel discretization scheme for the close enough traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
+Normal rank
@@ Property / cites work @@
+Q3447238
@@ Property / cites work: Q3447238 / rank @@
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
+Normal rank
@@ Property / cites work @@
+A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
+Normal rank