An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530): Difference between revisions

@@ Property / cites work @@
+Approximation algorithms for the Geometric Covering Salesman Problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for lawn mowing and milling
+Normal rank
@@ Property / cites work @@
+Optimal Covering Tours with Turn Costs
@@ Property / cites work: Optimal Covering Tours with Turn Costs / rank @@
+Normal rank
@@ Property / cites work @@
+The prize collecting traveling salesman problem
@@ Property / cites work: The prize collecting traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Covering Salesman Problem
@@ Property / cites work: The Covering Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for TSP with neighborhoods in the plane
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+The Covering Tour Problem
@@ Property / cites work: The Covering Tour Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4540081
@@ Property / cites work: Q4540081 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3447238
@@ Property / cites work: Q3447238 / rank @@
+Normal rank
@@ Property / cites work @@
+The Polygon Exploration Problem
@@ Property / cites work: The Polygon Exploration Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The bi-objective covering tour problem
@@ Property / cites work: The bi-objective covering tour problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
+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 / cites work @@
+Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized
+Normal rank