Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network (Q3564373): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-0-387-77778-8_22
+Normal rank
@@ Property / OpenAlex ID @@
+W164042131
@@ Property / OpenAlex ID: W164042131 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast heuristics for large scale covering-location problems
+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 @@
+The Covering Tour Problem
@@ Property / cites work: The Covering Tour Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3447238
@@ Property / cites work: Q3447238 / rank @@
+Normal rank
@@ Property / cites work @@
+A tiling and routing heuristic for the screening of cytological samples
+Normal rank