A novel discretization scheme for the close enough traveling salesman problem (Q1652067): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2016.09.003
@@ Property / DOI: 10.1016/j.cor.2016.09.003 / rank @@
-Normal rank
@@ Property / cites work @@
+Approximation algorithms for the Geometric Covering Salesman Problem
+Normal rank
@@ Property / cites work @@
+An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for TSP with neighborhoods in the plane
+Normal rank
@@ Property / cites work @@
+Q4461915
@@ Property / cites work: Q4461915 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3447238
@@ Property / cites work: Q3447238 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2867371
@@ Property / cites work: Q2867371 / rank @@
+Normal rank
@@ Property / cites work @@
+Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2016.09.003
@@ Property / DOI: 10.1016/J.COR.2016.09.003 / rank @@
+Normal rank